362.23/278.90 YES 362.23/278.90 362.23/278.90 Ultimate: Cannot open display: 362.23/278.90 This is Ultimate 0.1.24-8dc7c08-m 362.23/278.90 [2019-03-28 12:37:45,460 INFO L170 SettingsManager]: Resetting all preferences to default values... 362.23/278.90 [2019-03-28 12:37:45,462 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 362.23/278.90 [2019-03-28 12:37:45,473 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 362.23/278.90 [2019-03-28 12:37:45,474 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 362.23/278.90 [2019-03-28 12:37:45,475 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 362.23/278.90 [2019-03-28 12:37:45,476 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 362.23/278.90 [2019-03-28 12:37:45,477 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 362.23/278.90 [2019-03-28 12:37:45,479 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 362.23/278.90 [2019-03-28 12:37:45,480 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 362.23/278.90 [2019-03-28 12:37:45,480 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 362.23/278.90 [2019-03-28 12:37:45,481 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 362.23/278.90 [2019-03-28 12:37:45,482 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 362.23/278.90 [2019-03-28 12:37:45,482 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 362.23/278.90 [2019-03-28 12:37:45,483 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 362.23/278.90 [2019-03-28 12:37:45,484 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 362.23/278.90 [2019-03-28 12:37:45,485 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 362.23/278.90 [2019-03-28 12:37:45,487 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 362.23/278.90 [2019-03-28 12:37:45,489 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 362.23/278.90 [2019-03-28 12:37:45,490 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 362.23/278.90 [2019-03-28 12:37:45,491 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 362.23/278.90 [2019-03-28 12:37:45,492 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 362.23/278.90 [2019-03-28 12:37:45,495 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 362.23/278.90 [2019-03-28 12:37:45,495 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 362.23/278.90 [2019-03-28 12:37:45,495 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 362.23/278.90 [2019-03-28 12:37:45,496 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 362.23/278.90 [2019-03-28 12:37:45,496 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 362.23/278.90 [2019-03-28 12:37:45,497 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 362.23/278.90 [2019-03-28 12:37:45,497 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 362.23/278.90 [2019-03-28 12:37:45,498 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 362.23/278.90 [2019-03-28 12:37:45,499 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 362.23/278.90 [2019-03-28 12:37:45,499 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 362.23/278.90 [2019-03-28 12:37:45,500 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 362.23/278.90 [2019-03-28 12:37:45,501 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 362.23/278.90 [2019-03-28 12:37:45,501 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 362.23/278.90 [2019-03-28 12:37:45,501 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 362.23/278.90 [2019-03-28 12:37:45,502 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 362.23/278.90 [2019-03-28 12:37:45,503 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 362.23/278.90 [2019-03-28 12:37:45,503 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 362.23/278.90 [2019-03-28 12:37:45,503 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 362.23/278.90 [2019-03-28 12:37:45,518 INFO L110 SettingsManager]: Loading preferences was successful 362.23/278.90 [2019-03-28 12:37:45,519 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 362.23/278.90 [2019-03-28 12:37:45,520 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 362.23/278.90 [2019-03-28 12:37:45,520 INFO L133 SettingsManager]: * Rewrite not-equals=true 362.23/278.90 [2019-03-28 12:37:45,520 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 362.23/278.90 [2019-03-28 12:37:45,520 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 362.23/278.90 [2019-03-28 12:37:45,520 INFO L133 SettingsManager]: * Use SBE=true 362.23/278.90 [2019-03-28 12:37:45,521 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 362.23/278.90 [2019-03-28 12:37:45,521 INFO L133 SettingsManager]: * Use old map elimination=false 362.23/278.90 [2019-03-28 12:37:45,521 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 362.23/278.90 [2019-03-28 12:37:45,521 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 362.23/278.90 [2019-03-28 12:37:45,521 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 362.23/278.90 [2019-03-28 12:37:45,521 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 362.23/278.90 [2019-03-28 12:37:45,522 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 362.23/278.90 [2019-03-28 12:37:45,522 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 362.23/278.90 [2019-03-28 12:37:45,522 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 362.23/278.90 [2019-03-28 12:37:45,522 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 362.23/278.90 [2019-03-28 12:37:45,522 INFO L133 SettingsManager]: * Check division by zero=IGNORE 362.23/278.90 [2019-03-28 12:37:45,522 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 362.23/278.90 [2019-03-28 12:37:45,523 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 362.23/278.90 [2019-03-28 12:37:45,523 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 362.23/278.90 [2019-03-28 12:37:45,523 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 362.23/278.90 [2019-03-28 12:37:45,523 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 362.23/278.90 [2019-03-28 12:37:45,523 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 362.23/278.90 [2019-03-28 12:37:45,523 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 362.23/278.90 [2019-03-28 12:37:45,524 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 362.23/278.90 [2019-03-28 12:37:45,524 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 362.23/278.90 [2019-03-28 12:37:45,524 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 362.23/278.90 [2019-03-28 12:37:45,524 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 362.23/278.90 [2019-03-28 12:37:45,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 362.23/278.90 [2019-03-28 12:37:45,563 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 362.23/278.90 [2019-03-28 12:37:45,566 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 362.23/278.90 [2019-03-28 12:37:45,568 INFO L271 PluginConnector]: Initializing CDTParser... 362.23/278.90 [2019-03-28 12:37:45,568 INFO L276 PluginConnector]: CDTParser initialized 362.23/278.90 [2019-03-28 12:37:45,569 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 362.23/278.90 [2019-03-28 12:37:45,627 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/fa3179baa86d427bb347b841f9cfa29a/FLAGeee1ab4fc 362.23/278.90 [2019-03-28 12:37:45,989 INFO L307 CDTParser]: Found 1 translation units. 362.23/278.90 [2019-03-28 12:37:45,989 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 362.23/278.90 [2019-03-28 12:37:45,990 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 362.23/278.90 [2019-03-28 12:37:45,997 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/fa3179baa86d427bb347b841f9cfa29a/FLAGeee1ab4fc 362.23/278.90 [2019-03-28 12:37:46,380 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/fa3179baa86d427bb347b841f9cfa29a 362.23/278.90 [2019-03-28 12:37:46,391 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 362.23/278.90 [2019-03-28 12:37:46,393 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 362.23/278.90 [2019-03-28 12:37:46,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 362.23/278.90 [2019-03-28 12:37:46,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 362.23/278.90 [2019-03-28 12:37:46,398 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 362.23/278.90 [2019-03-28 12:37:46,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:37:46" (1/1) ... 362.23/278.90 [2019-03-28 12:37:46,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52803bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:46, skipping insertion in model container 362.23/278.90 [2019-03-28 12:37:46,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:37:46" (1/1) ... 362.23/278.90 [2019-03-28 12:37:46,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 362.23/278.90 [2019-03-28 12:37:46,428 INFO L176 MainTranslator]: Built tables and reachable declarations 362.23/278.90 [2019-03-28 12:37:46,597 INFO L206 PostProcessor]: Analyzing one entry point: main 362.23/278.90 [2019-03-28 12:37:46,609 INFO L191 MainTranslator]: Completed pre-run 362.23/278.90 [2019-03-28 12:37:46,630 INFO L206 PostProcessor]: Analyzing one entry point: main 362.23/278.90 [2019-03-28 12:37:46,703 INFO L195 MainTranslator]: Completed translation 362.23/278.90 [2019-03-28 12:37:46,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:46 WrapperNode 362.23/278.90 [2019-03-28 12:37:46,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 362.23/278.90 [2019-03-28 12:37:46,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 362.23/278.90 [2019-03-28 12:37:46,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 362.23/278.90 [2019-03-28 12:37:46,705 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 362.23/278.90 [2019-03-28 12:37:46,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:46" (1/1) ... 362.23/278.90 [2019-03-28 12:37:46,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:46" (1/1) ... 362.23/278.90 [2019-03-28 12:37:46,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 362.23/278.90 [2019-03-28 12:37:46,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 362.23/278.90 [2019-03-28 12:37:46,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 362.23/278.90 [2019-03-28 12:37:46,750 INFO L276 PluginConnector]: Boogie Preprocessor initialized 362.23/278.90 [2019-03-28 12:37:46,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:46" (1/1) ... 362.23/278.90 [2019-03-28 12:37:46,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:46" (1/1) ... 362.23/278.90 [2019-03-28 12:37:46,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:46" (1/1) ... 362.23/278.90 [2019-03-28 12:37:46,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:46" (1/1) ... 362.23/278.90 [2019-03-28 12:37:46,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:46" (1/1) ... 362.23/278.90 [2019-03-28 12:37:46,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:46" (1/1) ... 362.23/278.90 [2019-03-28 12:37:46,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:46" (1/1) ... 362.23/278.90 [2019-03-28 12:37:46,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 362.23/278.90 [2019-03-28 12:37:46,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 362.23/278.90 [2019-03-28 12:37:46,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... 362.23/278.90 [2019-03-28 12:37:46,780 INFO L276 PluginConnector]: RCFGBuilder initialized 362.23/278.90 [2019-03-28 12:37:46,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:46" (1/1) ... 362.23/278.90 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.90 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 362.23/278.90 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 362.23/278.90 [2019-03-28 12:37:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 362.23/278.90 [2019-03-28 12:37:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ 362.23/278.90 [2019-03-28 12:37:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 362.23/278.90 [2019-03-28 12:37:46,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 362.23/278.90 [2019-03-28 12:37:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 362.23/278.90 [2019-03-28 12:37:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ 362.23/278.90 [2019-03-28 12:37:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 362.23/278.90 [2019-03-28 12:37:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 362.23/278.90 [2019-03-28 12:37:47,172 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 362.23/278.90 [2019-03-28 12:37:47,173 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 362.23/278.90 [2019-03-28 12:37:47,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:47 BoogieIcfgContainer 362.23/278.90 [2019-03-28 12:37:47,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 362.23/278.90 [2019-03-28 12:37:47,175 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 362.23/278.90 [2019-03-28 12:37:47,175 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 362.23/278.90 [2019-03-28 12:37:47,177 INFO L276 PluginConnector]: BlockEncodingV2 initialized 362.23/278.90 [2019-03-28 12:37:47,178 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:47" (1/1) ... 362.23/278.90 [2019-03-28 12:37:47,197 INFO L313 BlockEncoder]: Initial Icfg 52 locations, 59 edges 362.23/278.90 [2019-03-28 12:37:47,199 INFO L258 BlockEncoder]: Using Remove infeasible edges 362.23/278.90 [2019-03-28 12:37:47,199 INFO L263 BlockEncoder]: Using Maximize final states 362.23/278.90 [2019-03-28 12:37:47,200 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 362.23/278.90 [2019-03-28 12:37:47,200 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 362.23/278.90 [2019-03-28 12:37:47,202 INFO L296 BlockEncoder]: Using Remove sink states 362.23/278.90 [2019-03-28 12:37:47,203 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 362.23/278.90 [2019-03-28 12:37:47,203 INFO L179 BlockEncoder]: Using Rewrite not-equals 362.23/278.90 [2019-03-28 12:37:47,230 INFO L185 BlockEncoder]: Using Use SBE 362.23/278.90 [2019-03-28 12:37:47,264 INFO L200 BlockEncoder]: SBE split 26 edges 362.23/278.90 [2019-03-28 12:37:47,269 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 362.23/278.90 [2019-03-28 12:37:47,271 INFO L71 MaximizeFinalStates]: 0 new accepting states 362.23/278.90 [2019-03-28 12:37:47,309 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding 362.23/278.90 [2019-03-28 12:37:47,312 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 362.23/278.90 [2019-03-28 12:37:47,313 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 362.23/278.90 [2019-03-28 12:37:47,313 INFO L71 MaximizeFinalStates]: 0 new accepting states 362.23/278.90 [2019-03-28 12:37:47,314 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 362.23/278.90 [2019-03-28 12:37:47,314 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 362.23/278.90 [2019-03-28 12:37:47,315 INFO L313 BlockEncoder]: Encoded RCFG 42 locations, 75 edges 362.23/278.90 [2019-03-28 12:37:47,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:37:47 BasicIcfg 362.23/278.90 [2019-03-28 12:37:47,315 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 362.23/278.90 [2019-03-28 12:37:47,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 362.23/278.90 [2019-03-28 12:37:47,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... 362.23/278.90 [2019-03-28 12:37:47,320 INFO L276 PluginConnector]: TraceAbstraction initialized 362.23/278.90 [2019-03-28 12:37:47,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:37:46" (1/4) ... 362.23/278.90 [2019-03-28 12:37:47,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a6a4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:37:47, skipping insertion in model container 362.23/278.90 [2019-03-28 12:37:47,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:46" (2/4) ... 362.23/278.90 [2019-03-28 12:37:47,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a6a4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:37:47, skipping insertion in model container 362.23/278.90 [2019-03-28 12:37:47,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:47" (3/4) ... 362.23/278.90 [2019-03-28 12:37:47,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a6a4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:37:47, skipping insertion in model container 362.23/278.90 [2019-03-28 12:37:47,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:37:47" (4/4) ... 362.23/278.90 [2019-03-28 12:37:47,324 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 362.23/278.90 [2019-03-28 12:37:47,334 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 362.23/278.90 [2019-03-28 12:37:47,342 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. 362.23/278.90 [2019-03-28 12:37:47,359 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. 362.23/278.90 [2019-03-28 12:37:47,389 INFO L133 ementStrategyFactory]: Using default assertion order modulation 362.23/278.90 [2019-03-28 12:37:47,390 INFO L382 AbstractCegarLoop]: Interprodecural is true 362.23/278.90 [2019-03-28 12:37:47,390 INFO L383 AbstractCegarLoop]: Hoare is true 362.23/278.90 [2019-03-28 12:37:47,390 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 362.23/278.90 [2019-03-28 12:37:47,390 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 362.23/278.90 [2019-03-28 12:37:47,390 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 362.23/278.90 [2019-03-28 12:37:47,390 INFO L387 AbstractCegarLoop]: Difference is false 362.23/278.90 [2019-03-28 12:37:47,391 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 362.23/278.90 [2019-03-28 12:37:47,391 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 362.23/278.90 [2019-03-28 12:37:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. 362.23/278.90 [2019-03-28 12:37:47,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 362.23/278.90 [2019-03-28 12:37:47,413 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:47,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:47,414 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:47,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:47,419 INFO L82 PathProgramCache]: Analyzing trace with hash 249743781, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:47,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:47,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:47,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:47,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:47,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.90 [2019-03-28 12:37:47,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.90 [2019-03-28 12:37:47,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 362.23/278.90 [2019-03-28 12:37:47,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 362.23/278.90 [2019-03-28 12:37:47,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 362.23/278.90 [2019-03-28 12:37:47,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 362.23/278.90 [2019-03-28 12:37:47,610 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. 362.23/278.90 [2019-03-28 12:37:47,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.90 [2019-03-28 12:37:47,779 INFO L93 Difference]: Finished difference Result 42 states and 75 transitions. 362.23/278.90 [2019-03-28 12:37:47,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 362.23/278.90 [2019-03-28 12:37:47,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 362.23/278.90 [2019-03-28 12:37:47,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.90 [2019-03-28 12:37:47,795 INFO L225 Difference]: With dead ends: 42 362.23/278.90 [2019-03-28 12:37:47,795 INFO L226 Difference]: Without dead ends: 41 362.23/278.90 [2019-03-28 12:37:47,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 362.23/278.90 [2019-03-28 12:37:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. 362.23/278.90 [2019-03-28 12:37:47,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. 362.23/278.90 [2019-03-28 12:37:47,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 362.23/278.90 [2019-03-28 12:37:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. 362.23/278.90 [2019-03-28 12:37:47,842 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 5 362.23/278.90 [2019-03-28 12:37:47,843 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.90 [2019-03-28 12:37:47,843 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. 362.23/278.90 [2019-03-28 12:37:47,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 362.23/278.90 [2019-03-28 12:37:47,844 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. 362.23/278.90 [2019-03-28 12:37:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 362.23/278.90 [2019-03-28 12:37:47,844 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:47,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:47,845 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:47,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:47,845 INFO L82 PathProgramCache]: Analyzing trace with hash 249743783, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:47,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:47,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:47,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:47,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:47,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:47,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.90 [2019-03-28 12:37:47,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.90 [2019-03-28 12:37:47,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 362.23/278.90 [2019-03-28 12:37:47,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 362.23/278.90 [2019-03-28 12:37:47,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 362.23/278.90 [2019-03-28 12:37:47,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 362.23/278.90 [2019-03-28 12:37:47,884 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 4 states. 362.23/278.90 [2019-03-28 12:37:47,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.90 [2019-03-28 12:37:47,998 INFO L93 Difference]: Finished difference Result 42 states and 73 transitions. 362.23/278.90 [2019-03-28 12:37:47,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 362.23/278.90 [2019-03-28 12:37:47,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 362.23/278.90 [2019-03-28 12:37:47,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.90 [2019-03-28 12:37:48,000 INFO L225 Difference]: With dead ends: 42 362.23/278.90 [2019-03-28 12:37:48,000 INFO L226 Difference]: Without dead ends: 41 362.23/278.90 [2019-03-28 12:37:48,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 362.23/278.90 [2019-03-28 12:37:48,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. 362.23/278.90 [2019-03-28 12:37:48,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. 362.23/278.90 [2019-03-28 12:37:48,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 362.23/278.90 [2019-03-28 12:37:48,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. 362.23/278.90 [2019-03-28 12:37:48,007 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 72 transitions. Word has length 5 362.23/278.90 [2019-03-28 12:37:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.90 [2019-03-28 12:37:48,008 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 72 transitions. 362.23/278.90 [2019-03-28 12:37:48,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 362.23/278.90 [2019-03-28 12:37:48,008 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 72 transitions. 362.23/278.90 [2019-03-28 12:37:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 362.23/278.90 [2019-03-28 12:37:48,008 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:48,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:48,009 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:48,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:48,009 INFO L82 PathProgramCache]: Analyzing trace with hash 249743784, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:48,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:48,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:48,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:48,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:48,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.90 [2019-03-28 12:37:48,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.90 [2019-03-28 12:37:48,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 362.23/278.90 [2019-03-28 12:37:48,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 362.23/278.90 [2019-03-28 12:37:48,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 362.23/278.90 [2019-03-28 12:37:48,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 362.23/278.90 [2019-03-28 12:37:48,042 INFO L87 Difference]: Start difference. First operand 41 states and 72 transitions. Second operand 3 states. 362.23/278.90 [2019-03-28 12:37:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.90 [2019-03-28 12:37:48,181 INFO L93 Difference]: Finished difference Result 41 states and 72 transitions. 362.23/278.90 [2019-03-28 12:37:48,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 362.23/278.90 [2019-03-28 12:37:48,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 362.23/278.90 [2019-03-28 12:37:48,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.90 [2019-03-28 12:37:48,183 INFO L225 Difference]: With dead ends: 41 362.23/278.90 [2019-03-28 12:37:48,183 INFO L226 Difference]: Without dead ends: 40 362.23/278.90 [2019-03-28 12:37:48,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 362.23/278.90 [2019-03-28 12:37:48,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. 362.23/278.90 [2019-03-28 12:37:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. 362.23/278.90 [2019-03-28 12:37:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. 362.23/278.90 [2019-03-28 12:37:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 71 transitions. 362.23/278.90 [2019-03-28 12:37:48,189 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 71 transitions. Word has length 5 362.23/278.90 [2019-03-28 12:37:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.90 [2019-03-28 12:37:48,189 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 71 transitions. 362.23/278.90 [2019-03-28 12:37:48,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 362.23/278.90 [2019-03-28 12:37:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 71 transitions. 362.23/278.90 [2019-03-28 12:37:48,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 362.23/278.90 [2019-03-28 12:37:48,190 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:48,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:48,190 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:48,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:48,191 INFO L82 PathProgramCache]: Analyzing trace with hash -514455262, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:48,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:48,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:48,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:48,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:48,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.90 [2019-03-28 12:37:48,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.90 [2019-03-28 12:37:48,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 362.23/278.90 [2019-03-28 12:37:48,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 362.23/278.90 [2019-03-28 12:37:48,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 362.23/278.90 [2019-03-28 12:37:48,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 362.23/278.90 [2019-03-28 12:37:48,233 INFO L87 Difference]: Start difference. First operand 40 states and 71 transitions. Second operand 3 states. 362.23/278.90 [2019-03-28 12:37:48,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.90 [2019-03-28 12:37:48,341 INFO L93 Difference]: Finished difference Result 40 states and 71 transitions. 362.23/278.90 [2019-03-28 12:37:48,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 362.23/278.90 [2019-03-28 12:37:48,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 362.23/278.90 [2019-03-28 12:37:48,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.90 [2019-03-28 12:37:48,343 INFO L225 Difference]: With dead ends: 40 362.23/278.90 [2019-03-28 12:37:48,343 INFO L226 Difference]: Without dead ends: 34 362.23/278.90 [2019-03-28 12:37:48,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 362.23/278.90 [2019-03-28 12:37:48,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 362.23/278.90 [2019-03-28 12:37:48,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. 362.23/278.90 [2019-03-28 12:37:48,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 362.23/278.90 [2019-03-28 12:37:48,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 59 transitions. 362.23/278.90 [2019-03-28 12:37:48,348 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 59 transitions. Word has length 7 362.23/278.90 [2019-03-28 12:37:48,349 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.90 [2019-03-28 12:37:48,349 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 59 transitions. 362.23/278.90 [2019-03-28 12:37:48,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 362.23/278.90 [2019-03-28 12:37:48,349 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 59 transitions. 362.23/278.90 [2019-03-28 12:37:48,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 362.23/278.90 [2019-03-28 12:37:48,350 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:48,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:48,350 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:48,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:48,351 INFO L82 PathProgramCache]: Analyzing trace with hash -514455260, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:48,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:48,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:48,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:48,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:48,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.90 [2019-03-28 12:37:48,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.90 [2019-03-28 12:37:48,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 362.23/278.90 [2019-03-28 12:37:48,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 362.23/278.90 [2019-03-28 12:37:48,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 362.23/278.90 [2019-03-28 12:37:48,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 362.23/278.90 [2019-03-28 12:37:48,397 INFO L87 Difference]: Start difference. First operand 34 states and 59 transitions. Second operand 4 states. 362.23/278.90 [2019-03-28 12:37:48,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.90 [2019-03-28 12:37:48,485 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. 362.23/278.90 [2019-03-28 12:37:48,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 362.23/278.90 [2019-03-28 12:37:48,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 362.23/278.90 [2019-03-28 12:37:48,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.90 [2019-03-28 12:37:48,487 INFO L225 Difference]: With dead ends: 40 362.23/278.90 [2019-03-28 12:37:48,487 INFO L226 Difference]: Without dead ends: 34 362.23/278.90 [2019-03-28 12:37:48,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 362.23/278.90 [2019-03-28 12:37:48,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 362.23/278.90 [2019-03-28 12:37:48,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. 362.23/278.90 [2019-03-28 12:37:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 362.23/278.90 [2019-03-28 12:37:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 53 transitions. 362.23/278.90 [2019-03-28 12:37:48,492 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 53 transitions. Word has length 7 362.23/278.90 [2019-03-28 12:37:48,492 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.90 [2019-03-28 12:37:48,492 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 53 transitions. 362.23/278.90 [2019-03-28 12:37:48,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 362.23/278.90 [2019-03-28 12:37:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 53 transitions. 362.23/278.90 [2019-03-28 12:37:48,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 362.23/278.90 [2019-03-28 12:37:48,493 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:48,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:48,493 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:48,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:48,494 INFO L82 PathProgramCache]: Analyzing trace with hash -514455259, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:48,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:48,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:48,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:48,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:48,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.90 [2019-03-28 12:37:48,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.90 [2019-03-28 12:37:48,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 362.23/278.90 [2019-03-28 12:37:48,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 362.23/278.90 [2019-03-28 12:37:48,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 362.23/278.90 [2019-03-28 12:37:48,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 362.23/278.90 [2019-03-28 12:37:48,551 INFO L87 Difference]: Start difference. First operand 34 states and 53 transitions. Second operand 4 states. 362.23/278.90 [2019-03-28 12:37:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.90 [2019-03-28 12:37:48,646 INFO L93 Difference]: Finished difference Result 34 states and 53 transitions. 362.23/278.90 [2019-03-28 12:37:48,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 362.23/278.90 [2019-03-28 12:37:48,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 362.23/278.90 [2019-03-28 12:37:48,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.90 [2019-03-28 12:37:48,648 INFO L225 Difference]: With dead ends: 34 362.23/278.90 [2019-03-28 12:37:48,648 INFO L226 Difference]: Without dead ends: 27 362.23/278.90 [2019-03-28 12:37:48,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 362.23/278.90 [2019-03-28 12:37:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 362.23/278.90 [2019-03-28 12:37:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 362.23/278.90 [2019-03-28 12:37:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 362.23/278.90 [2019-03-28 12:37:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 44 transitions. 362.23/278.90 [2019-03-28 12:37:48,652 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 44 transitions. Word has length 7 362.23/278.90 [2019-03-28 12:37:48,653 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.90 [2019-03-28 12:37:48,653 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 44 transitions. 362.23/278.90 [2019-03-28 12:37:48,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 362.23/278.90 [2019-03-28 12:37:48,653 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 44 transitions. 362.23/278.90 [2019-03-28 12:37:48,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 362.23/278.90 [2019-03-28 12:37:48,653 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:48,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:48,654 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:48,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:48,654 INFO L82 PathProgramCache]: Analyzing trace with hash -807856432, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:48,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:48,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:48,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:48,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:48,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.90 [2019-03-28 12:37:48,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.90 [2019-03-28 12:37:48,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 362.23/278.90 [2019-03-28 12:37:48,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 362.23/278.90 [2019-03-28 12:37:48,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 362.23/278.90 [2019-03-28 12:37:48,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 362.23/278.90 [2019-03-28 12:37:48,767 INFO L87 Difference]: Start difference. First operand 27 states and 44 transitions. Second operand 7 states. 362.23/278.90 [2019-03-28 12:37:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.90 [2019-03-28 12:37:48,968 INFO L93 Difference]: Finished difference Result 27 states and 44 transitions. 362.23/278.90 [2019-03-28 12:37:48,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 362.23/278.90 [2019-03-28 12:37:48,969 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 362.23/278.90 [2019-03-28 12:37:48,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.90 [2019-03-28 12:37:48,970 INFO L225 Difference]: With dead ends: 27 362.23/278.90 [2019-03-28 12:37:48,970 INFO L226 Difference]: Without dead ends: 26 362.23/278.90 [2019-03-28 12:37:48,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 362.23/278.90 [2019-03-28 12:37:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. 362.23/278.90 [2019-03-28 12:37:48,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 362.23/278.90 [2019-03-28 12:37:48,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 362.23/278.90 [2019-03-28 12:37:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 42 transitions. 362.23/278.90 [2019-03-28 12:37:48,974 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 42 transitions. Word has length 13 362.23/278.90 [2019-03-28 12:37:48,974 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.90 [2019-03-28 12:37:48,974 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 42 transitions. 362.23/278.90 [2019-03-28 12:37:48,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 362.23/278.90 [2019-03-28 12:37:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 42 transitions. 362.23/278.90 [2019-03-28 12:37:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 362.23/278.90 [2019-03-28 12:37:48,975 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:48,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:48,975 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:48,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:48,976 INFO L82 PathProgramCache]: Analyzing trace with hash -807856430, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:48,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:48,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:48,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:48,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:48,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:49,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.90 [2019-03-28 12:37:49,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.90 [2019-03-28 12:37:49,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 362.23/278.90 [2019-03-28 12:37:49,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states 362.23/278.90 [2019-03-28 12:37:49,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 362.23/278.90 [2019-03-28 12:37:49,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 362.23/278.90 [2019-03-28 12:37:49,227 INFO L87 Difference]: Start difference. First operand 26 states and 42 transitions. Second operand 11 states. 362.23/278.90 [2019-03-28 12:37:49,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.90 [2019-03-28 12:37:49,692 INFO L93 Difference]: Finished difference Result 30 states and 46 transitions. 362.23/278.90 [2019-03-28 12:37:49,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 362.23/278.90 [2019-03-28 12:37:49,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 362.23/278.90 [2019-03-28 12:37:49,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.90 [2019-03-28 12:37:49,693 INFO L225 Difference]: With dead ends: 30 362.23/278.90 [2019-03-28 12:37:49,693 INFO L226 Difference]: Without dead ends: 29 362.23/278.90 [2019-03-28 12:37:49,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 362.23/278.90 [2019-03-28 12:37:49,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 362.23/278.90 [2019-03-28 12:37:49,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. 362.23/278.90 [2019-03-28 12:37:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 362.23/278.90 [2019-03-28 12:37:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. 362.23/278.90 [2019-03-28 12:37:49,700 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 13 362.23/278.90 [2019-03-28 12:37:49,700 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.90 [2019-03-28 12:37:49,700 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 45 transitions. 362.23/278.90 [2019-03-28 12:37:49,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. 362.23/278.90 [2019-03-28 12:37:49,700 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. 362.23/278.90 [2019-03-28 12:37:49,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 362.23/278.90 [2019-03-28 12:37:49,701 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:49,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:49,701 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:49,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:49,702 INFO L82 PathProgramCache]: Analyzing trace with hash -807856429, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:49,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:49,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:49,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:49,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:49,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.90 [2019-03-28 12:37:49,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.90 [2019-03-28 12:37:49,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 362.23/278.90 [2019-03-28 12:37:49,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 362.23/278.90 [2019-03-28 12:37:49,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 362.23/278.90 [2019-03-28 12:37:49,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 362.23/278.90 [2019-03-28 12:37:49,761 INFO L87 Difference]: Start difference. First operand 28 states and 45 transitions. Second operand 7 states. 362.23/278.90 [2019-03-28 12:37:49,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.90 [2019-03-28 12:37:49,871 INFO L93 Difference]: Finished difference Result 29 states and 45 transitions. 362.23/278.90 [2019-03-28 12:37:49,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 362.23/278.90 [2019-03-28 12:37:49,872 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 362.23/278.90 [2019-03-28 12:37:49,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.90 [2019-03-28 12:37:49,873 INFO L225 Difference]: With dead ends: 29 362.23/278.90 [2019-03-28 12:37:49,873 INFO L226 Difference]: Without dead ends: 28 362.23/278.90 [2019-03-28 12:37:49,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 362.23/278.90 [2019-03-28 12:37:49,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 362.23/278.90 [2019-03-28 12:37:49,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 362.23/278.90 [2019-03-28 12:37:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 362.23/278.90 [2019-03-28 12:37:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 43 transitions. 362.23/278.90 [2019-03-28 12:37:49,877 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 43 transitions. Word has length 13 362.23/278.90 [2019-03-28 12:37:49,877 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.90 [2019-03-28 12:37:49,877 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 43 transitions. 362.23/278.90 [2019-03-28 12:37:49,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 362.23/278.90 [2019-03-28 12:37:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 43 transitions. 362.23/278.90 [2019-03-28 12:37:49,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 362.23/278.90 [2019-03-28 12:37:49,878 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:49,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:49,879 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:49,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:49,879 INFO L82 PathProgramCache]: Analyzing trace with hash 726251409, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:49,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:49,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:49,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:49,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:49,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.90 [2019-03-28 12:37:49,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.90 [2019-03-28 12:37:49,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 362.23/278.90 [2019-03-28 12:37:49,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 362.23/278.90 [2019-03-28 12:37:49,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 362.23/278.90 [2019-03-28 12:37:49,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 362.23/278.90 [2019-03-28 12:37:49,955 INFO L87 Difference]: Start difference. First operand 28 states and 43 transitions. Second operand 7 states. 362.23/278.90 [2019-03-28 12:37:50,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.90 [2019-03-28 12:37:50,263 INFO L93 Difference]: Finished difference Result 57 states and 85 transitions. 362.23/278.90 [2019-03-28 12:37:50,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 362.23/278.90 [2019-03-28 12:37:50,264 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 362.23/278.90 [2019-03-28 12:37:50,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.90 [2019-03-28 12:37:50,264 INFO L225 Difference]: With dead ends: 57 362.23/278.90 [2019-03-28 12:37:50,265 INFO L226 Difference]: Without dead ends: 56 362.23/278.90 [2019-03-28 12:37:50,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 362.23/278.90 [2019-03-28 12:37:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. 362.23/278.90 [2019-03-28 12:37:50,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. 362.23/278.90 [2019-03-28 12:37:50,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. 362.23/278.90 [2019-03-28 12:37:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 66 transitions. 362.23/278.90 [2019-03-28 12:37:50,271 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 66 transitions. Word has length 14 362.23/278.90 [2019-03-28 12:37:50,271 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.90 [2019-03-28 12:37:50,272 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 66 transitions. 362.23/278.90 [2019-03-28 12:37:50,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 362.23/278.90 [2019-03-28 12:37:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. 362.23/278.90 [2019-03-28 12:37:50,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 362.23/278.90 [2019-03-28 12:37:50,273 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:50,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:50,273 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:50,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:50,273 INFO L82 PathProgramCache]: Analyzing trace with hash 726251411, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:50,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:50,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:50,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:50,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:50,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:50,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.90 [2019-03-28 12:37:50,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.90 [2019-03-28 12:37:50,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 362.23/278.90 [2019-03-28 12:37:50,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states 362.23/278.90 [2019-03-28 12:37:50,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. 362.23/278.90 [2019-03-28 12:37:50,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 362.23/278.90 [2019-03-28 12:37:50,394 INFO L87 Difference]: Start difference. First operand 43 states and 66 transitions. Second operand 10 states. 362.23/278.90 [2019-03-28 12:37:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.90 [2019-03-28 12:37:50,970 INFO L93 Difference]: Finished difference Result 77 states and 110 transitions. 362.23/278.90 [2019-03-28 12:37:50,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 362.23/278.90 [2019-03-28 12:37:50,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 362.23/278.90 [2019-03-28 12:37:50,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.90 [2019-03-28 12:37:50,971 INFO L225 Difference]: With dead ends: 77 362.23/278.90 [2019-03-28 12:37:50,971 INFO L226 Difference]: Without dead ends: 76 362.23/278.90 [2019-03-28 12:37:50,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 362.23/278.90 [2019-03-28 12:37:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. 362.23/278.90 [2019-03-28 12:37:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 44. 362.23/278.90 [2019-03-28 12:37:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. 362.23/278.90 [2019-03-28 12:37:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 68 transitions. 362.23/278.90 [2019-03-28 12:37:50,978 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 68 transitions. Word has length 14 362.23/278.90 [2019-03-28 12:37:50,978 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.90 [2019-03-28 12:37:50,978 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 68 transitions. 362.23/278.90 [2019-03-28 12:37:50,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. 362.23/278.90 [2019-03-28 12:37:50,979 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. 362.23/278.90 [2019-03-28 12:37:50,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 362.23/278.90 [2019-03-28 12:37:50,979 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:50,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:50,980 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:50,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:50,980 INFO L82 PathProgramCache]: Analyzing trace with hash 726251412, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:50,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:50,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:50,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:50,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:50,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:51,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.90 [2019-03-28 12:37:51,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.90 [2019-03-28 12:37:51,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 362.23/278.90 [2019-03-28 12:37:51,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 362.23/278.90 [2019-03-28 12:37:51,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 362.23/278.90 [2019-03-28 12:37:51,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 362.23/278.90 [2019-03-28 12:37:51,077 INFO L87 Difference]: Start difference. First operand 44 states and 68 transitions. Second operand 9 states. 362.23/278.90 [2019-03-28 12:37:51,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.90 [2019-03-28 12:37:51,328 INFO L93 Difference]: Finished difference Result 48 states and 73 transitions. 362.23/278.90 [2019-03-28 12:37:51,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 362.23/278.90 [2019-03-28 12:37:51,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 362.23/278.90 [2019-03-28 12:37:51,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.90 [2019-03-28 12:37:51,329 INFO L225 Difference]: With dead ends: 48 362.23/278.90 [2019-03-28 12:37:51,329 INFO L226 Difference]: Without dead ends: 47 362.23/278.90 [2019-03-28 12:37:51,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 362.23/278.90 [2019-03-28 12:37:51,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. 362.23/278.90 [2019-03-28 12:37:51,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. 362.23/278.90 [2019-03-28 12:37:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. 362.23/278.90 [2019-03-28 12:37:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. 362.23/278.90 [2019-03-28 12:37:51,335 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 14 362.23/278.90 [2019-03-28 12:37:51,335 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.90 [2019-03-28 12:37:51,335 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. 362.23/278.90 [2019-03-28 12:37:51,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 362.23/278.90 [2019-03-28 12:37:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. 362.23/278.90 [2019-03-28 12:37:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 362.23/278.90 [2019-03-28 12:37:51,336 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:51,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:51,337 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:51,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:51,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1070699950, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:51,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:51,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:51,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:51,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:51,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:51,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.90 [2019-03-28 12:37:51,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.90 [2019-03-28 12:37:51,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 362.23/278.90 [2019-03-28 12:37:51,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 362.23/278.90 [2019-03-28 12:37:51,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 362.23/278.90 [2019-03-28 12:37:51,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 362.23/278.90 [2019-03-28 12:37:51,417 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 7 states. 362.23/278.90 [2019-03-28 12:37:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.90 [2019-03-28 12:37:51,619 INFO L93 Difference]: Finished difference Result 49 states and 73 transitions. 362.23/278.90 [2019-03-28 12:37:51,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 362.23/278.90 [2019-03-28 12:37:51,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 362.23/278.90 [2019-03-28 12:37:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.90 [2019-03-28 12:37:51,620 INFO L225 Difference]: With dead ends: 49 362.23/278.90 [2019-03-28 12:37:51,621 INFO L226 Difference]: Without dead ends: 48 362.23/278.90 [2019-03-28 12:37:51,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 362.23/278.90 [2019-03-28 12:37:51,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. 362.23/278.90 [2019-03-28 12:37:51,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. 362.23/278.90 [2019-03-28 12:37:51,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. 362.23/278.90 [2019-03-28 12:37:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. 362.23/278.90 [2019-03-28 12:37:51,626 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 14 362.23/278.90 [2019-03-28 12:37:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.90 [2019-03-28 12:37:51,626 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. 362.23/278.90 [2019-03-28 12:37:51,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 362.23/278.90 [2019-03-28 12:37:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. 362.23/278.90 [2019-03-28 12:37:51,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 362.23/278.90 [2019-03-28 12:37:51,627 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:51,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:51,628 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:51,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:51,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1070699948, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:51,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:51,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:51,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:51,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:51,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.90 [2019-03-28 12:37:51,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.90 [2019-03-28 12:37:51,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 362.23/278.90 [2019-03-28 12:37:51,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states 362.23/278.90 [2019-03-28 12:37:51,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. 362.23/278.90 [2019-03-28 12:37:51,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 362.23/278.90 [2019-03-28 12:37:51,774 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand 10 states. 362.23/278.90 [2019-03-28 12:37:52,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.90 [2019-03-28 12:37:52,051 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. 362.23/278.90 [2019-03-28 12:37:52,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 362.23/278.90 [2019-03-28 12:37:52,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 362.23/278.90 [2019-03-28 12:37:52,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.90 [2019-03-28 12:37:52,052 INFO L225 Difference]: With dead ends: 39 362.23/278.90 [2019-03-28 12:37:52,052 INFO L226 Difference]: Without dead ends: 38 362.23/278.90 [2019-03-28 12:37:52,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 362.23/278.90 [2019-03-28 12:37:52,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. 362.23/278.90 [2019-03-28 12:37:52,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. 362.23/278.90 [2019-03-28 12:37:52,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 362.23/278.90 [2019-03-28 12:37:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. 362.23/278.90 [2019-03-28 12:37:52,057 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 14 362.23/278.90 [2019-03-28 12:37:52,057 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.90 [2019-03-28 12:37:52,057 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. 362.23/278.90 [2019-03-28 12:37:52,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. 362.23/278.90 [2019-03-28 12:37:52,058 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. 362.23/278.90 [2019-03-28 12:37:52,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 362.23/278.90 [2019-03-28 12:37:52,058 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:52,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:52,059 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:52,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:52,059 INFO L82 PathProgramCache]: Analyzing trace with hash 20130026, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:52,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:52,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:52,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:52,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:52,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.90 [2019-03-28 12:37:52,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.90 [2019-03-28 12:37:52,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 362.23/278.90 [2019-03-28 12:37:52,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 362.23/278.90 [2019-03-28 12:37:52,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 362.23/278.90 [2019-03-28 12:37:52,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 362.23/278.90 [2019-03-28 12:37:52,107 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand 5 states. 362.23/278.90 [2019-03-28 12:37:52,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.90 [2019-03-28 12:37:52,205 INFO L93 Difference]: Finished difference Result 28 states and 41 transitions. 362.23/278.90 [2019-03-28 12:37:52,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 362.23/278.90 [2019-03-28 12:37:52,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 362.23/278.90 [2019-03-28 12:37:52,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.90 [2019-03-28 12:37:52,206 INFO L225 Difference]: With dead ends: 28 362.23/278.90 [2019-03-28 12:37:52,206 INFO L226 Difference]: Without dead ends: 27 362.23/278.90 [2019-03-28 12:37:52,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 362.23/278.90 [2019-03-28 12:37:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 362.23/278.90 [2019-03-28 12:37:52,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 362.23/278.90 [2019-03-28 12:37:52,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 362.23/278.90 [2019-03-28 12:37:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. 362.23/278.90 [2019-03-28 12:37:52,211 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 19 362.23/278.90 [2019-03-28 12:37:52,211 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.90 [2019-03-28 12:37:52,211 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. 362.23/278.90 [2019-03-28 12:37:52,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 362.23/278.90 [2019-03-28 12:37:52,211 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. 362.23/278.90 [2019-03-28 12:37:52,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 362.23/278.90 [2019-03-28 12:37:52,212 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:52,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:52,212 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:52,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:52,213 INFO L82 PathProgramCache]: Analyzing trace with hash 20130028, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:52,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:52,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:52,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:52,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:52,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.90 [2019-03-28 12:37:52,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.90 [2019-03-28 12:37:52,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 362.23/278.90 [2019-03-28 12:37:52,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states 362.23/278.90 [2019-03-28 12:37:52,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. 362.23/278.90 [2019-03-28 12:37:52,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 362.23/278.90 [2019-03-28 12:37:52,379 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand 12 states. 362.23/278.90 [2019-03-28 12:37:52,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.90 [2019-03-28 12:37:52,947 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. 362.23/278.90 [2019-03-28 12:37:52,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 362.23/278.90 [2019-03-28 12:37:52,947 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 362.23/278.90 [2019-03-28 12:37:52,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.90 [2019-03-28 12:37:52,948 INFO L225 Difference]: With dead ends: 59 362.23/278.90 [2019-03-28 12:37:52,948 INFO L226 Difference]: Without dead ends: 58 362.23/278.90 [2019-03-28 12:37:52,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 362.23/278.90 [2019-03-28 12:37:52,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. 362.23/278.90 [2019-03-28 12:37:52,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. 362.23/278.90 [2019-03-28 12:37:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. 362.23/278.90 [2019-03-28 12:37:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. 362.23/278.90 [2019-03-28 12:37:52,955 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 19 362.23/278.90 [2019-03-28 12:37:52,955 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.90 [2019-03-28 12:37:52,955 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. 362.23/278.90 [2019-03-28 12:37:52,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. 362.23/278.90 [2019-03-28 12:37:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. 362.23/278.90 [2019-03-28 12:37:52,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 362.23/278.90 [2019-03-28 12:37:52,956 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:52,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:52,957 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:52,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:52,957 INFO L82 PathProgramCache]: Analyzing trace with hash 20130029, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:52,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:52,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:52,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:52,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:52,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.90 [2019-03-28 12:37:52,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.90 [2019-03-28 12:37:52,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 362.23/278.90 [2019-03-28 12:37:52,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 362.23/278.90 [2019-03-28 12:37:52,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 362.23/278.90 [2019-03-28 12:37:52,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 362.23/278.90 [2019-03-28 12:37:52,994 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 5 states. 362.23/278.90 [2019-03-28 12:37:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.90 [2019-03-28 12:37:53,101 INFO L93 Difference]: Finished difference Result 49 states and 71 transitions. 362.23/278.90 [2019-03-28 12:37:53,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 362.23/278.90 [2019-03-28 12:37:53,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 362.23/278.90 [2019-03-28 12:37:53,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.90 [2019-03-28 12:37:53,102 INFO L225 Difference]: With dead ends: 49 362.23/278.90 [2019-03-28 12:37:53,102 INFO L226 Difference]: Without dead ends: 48 362.23/278.90 [2019-03-28 12:37:53,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 362.23/278.90 [2019-03-28 12:37:53,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. 362.23/278.90 [2019-03-28 12:37:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. 362.23/278.90 [2019-03-28 12:37:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. 362.23/278.90 [2019-03-28 12:37:53,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. 362.23/278.90 [2019-03-28 12:37:53,108 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 19 362.23/278.90 [2019-03-28 12:37:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.90 [2019-03-28 12:37:53,109 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. 362.23/278.90 [2019-03-28 12:37:53,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 362.23/278.90 [2019-03-28 12:37:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. 362.23/278.90 [2019-03-28 12:37:53,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 362.23/278.90 [2019-03-28 12:37:53,110 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:53,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:53,110 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:53,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:53,110 INFO L82 PathProgramCache]: Analyzing trace with hash 20130059, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:53,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:53,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:53,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:53,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:53,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.90 [2019-03-28 12:37:53,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.90 [2019-03-28 12:37:53,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 362.23/278.90 [2019-03-28 12:37:53,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 362.23/278.90 [2019-03-28 12:37:53,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 362.23/278.90 [2019-03-28 12:37:53,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 362.23/278.90 [2019-03-28 12:37:53,160 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 4 states. 362.23/278.90 [2019-03-28 12:37:53,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.90 [2019-03-28 12:37:53,226 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. 362.23/278.90 [2019-03-28 12:37:53,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 362.23/278.90 [2019-03-28 12:37:53,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 362.23/278.90 [2019-03-28 12:37:53,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.90 [2019-03-28 12:37:53,227 INFO L225 Difference]: With dead ends: 78 362.23/278.90 [2019-03-28 12:37:53,227 INFO L226 Difference]: Without dead ends: 70 362.23/278.90 [2019-03-28 12:37:53,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 362.23/278.90 [2019-03-28 12:37:53,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. 362.23/278.90 [2019-03-28 12:37:53,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. 362.23/278.90 [2019-03-28 12:37:53,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. 362.23/278.90 [2019-03-28 12:37:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. 362.23/278.90 [2019-03-28 12:37:53,236 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 19 362.23/278.90 [2019-03-28 12:37:53,236 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.90 [2019-03-28 12:37:53,236 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. 362.23/278.90 [2019-03-28 12:37:53,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 362.23/278.90 [2019-03-28 12:37:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. 362.23/278.90 [2019-03-28 12:37:53,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 362.23/278.90 [2019-03-28 12:37:53,237 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:53,238 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:53,238 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:53,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:53,238 INFO L82 PathProgramCache]: Analyzing trace with hash 129418681, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:53,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:53,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:53,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:53,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:53,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.90 [2019-03-28 12:37:53,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.90 [2019-03-28 12:37:53,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 362.23/278.90 [2019-03-28 12:37:53,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states 362.23/278.90 [2019-03-28 12:37:53,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 362.23/278.90 [2019-03-28 12:37:53,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 362.23/278.90 [2019-03-28 12:37:53,439 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. Second operand 11 states. 362.23/278.90 [2019-03-28 12:37:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.90 [2019-03-28 12:37:53,934 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. 362.23/278.90 [2019-03-28 12:37:53,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 362.23/278.90 [2019-03-28 12:37:53,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 362.23/278.90 [2019-03-28 12:37:53,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.90 [2019-03-28 12:37:53,936 INFO L225 Difference]: With dead ends: 182 362.23/278.90 [2019-03-28 12:37:53,936 INFO L226 Difference]: Without dead ends: 158 362.23/278.90 [2019-03-28 12:37:53,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 362.23/278.90 [2019-03-28 12:37:53,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. 362.23/278.90 [2019-03-28 12:37:53,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 106. 362.23/278.90 [2019-03-28 12:37:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. 362.23/278.90 [2019-03-28 12:37:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 142 transitions. 362.23/278.90 [2019-03-28 12:37:53,950 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 142 transitions. Word has length 19 362.23/278.90 [2019-03-28 12:37:53,950 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.90 [2019-03-28 12:37:53,950 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 142 transitions. 362.23/278.90 [2019-03-28 12:37:53,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. 362.23/278.90 [2019-03-28 12:37:53,950 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 142 transitions. 362.23/278.90 [2019-03-28 12:37:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 362.23/278.90 [2019-03-28 12:37:53,951 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.90 [2019-03-28 12:37:53,951 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.90 [2019-03-28 12:37:53,951 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.90 [2019-03-28 12:37:53,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.90 [2019-03-28 12:37:53,952 INFO L82 PathProgramCache]: Analyzing trace with hash 130342202, now seen corresponding path program 1 times 362.23/278.90 [2019-03-28 12:37:53,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.90 [2019-03-28 12:37:53,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.90 [2019-03-28 12:37:53,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:53,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:53,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.90 [2019-03-28 12:37:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.90 [2019-03-28 12:37:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:37:54,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:37:54,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 362.23/278.91 [2019-03-28 12:37:54,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states 362.23/278.91 [2019-03-28 12:37:54,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 362.23/278.91 [2019-03-28 12:37:54,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 362.23/278.91 [2019-03-28 12:37:54,097 INFO L87 Difference]: Start difference. First operand 106 states and 142 transitions. Second operand 11 states. 362.23/278.91 [2019-03-28 12:37:54,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:37:54,466 INFO L93 Difference]: Finished difference Result 146 states and 196 transitions. 362.23/278.91 [2019-03-28 12:37:54,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 362.23/278.91 [2019-03-28 12:37:54,466 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 362.23/278.91 [2019-03-28 12:37:54,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:37:54,467 INFO L225 Difference]: With dead ends: 146 362.23/278.91 [2019-03-28 12:37:54,467 INFO L226 Difference]: Without dead ends: 122 362.23/278.91 [2019-03-28 12:37:54,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 362.23/278.91 [2019-03-28 12:37:54,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. 362.23/278.91 [2019-03-28 12:37:54,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 106. 362.23/278.91 [2019-03-28 12:37:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. 362.23/278.91 [2019-03-28 12:37:54,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 138 transitions. 362.23/278.91 [2019-03-28 12:37:54,480 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 138 transitions. Word has length 19 362.23/278.91 [2019-03-28 12:37:54,480 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:37:54,480 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 138 transitions. 362.23/278.91 [2019-03-28 12:37:54,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. 362.23/278.91 [2019-03-28 12:37:54,480 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. 362.23/278.91 [2019-03-28 12:37:54,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 362.23/278.91 [2019-03-28 12:37:54,481 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:37:54,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:37:54,481 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:37:54,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:37:54,482 INFO L82 PathProgramCache]: Analyzing trace with hash 149212778, now seen corresponding path program 1 times 362.23/278.91 [2019-03-28 12:37:54,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:37:54,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:37:54,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:37:54,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:37:54,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:37:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:37:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:37:54,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:37:54,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 362.23/278.91 [2019-03-28 12:37:54,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 362.23/278.91 [2019-03-28 12:37:54,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 362.23/278.91 [2019-03-28 12:37:54,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 362.23/278.91 [2019-03-28 12:37:54,522 INFO L87 Difference]: Start difference. First operand 106 states and 138 transitions. Second operand 5 states. 362.23/278.91 [2019-03-28 12:37:54,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:37:54,602 INFO L93 Difference]: Finished difference Result 132 states and 175 transitions. 362.23/278.91 [2019-03-28 12:37:54,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 362.23/278.91 [2019-03-28 12:37:54,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 362.23/278.91 [2019-03-28 12:37:54,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:37:54,604 INFO L225 Difference]: With dead ends: 132 362.23/278.91 [2019-03-28 12:37:54,604 INFO L226 Difference]: Without dead ends: 82 362.23/278.91 [2019-03-28 12:37:54,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 362.23/278.91 [2019-03-28 12:37:54,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. 362.23/278.91 [2019-03-28 12:37:54,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. 362.23/278.91 [2019-03-28 12:37:54,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. 362.23/278.91 [2019-03-28 12:37:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 108 transitions. 362.23/278.91 [2019-03-28 12:37:54,613 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 108 transitions. Word has length 19 362.23/278.91 [2019-03-28 12:37:54,613 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:37:54,614 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 108 transitions. 362.23/278.91 [2019-03-28 12:37:54,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 362.23/278.91 [2019-03-28 12:37:54,614 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. 362.23/278.91 [2019-03-28 12:37:54,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 362.23/278.91 [2019-03-28 12:37:54,614 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:37:54,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:37:54,615 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:37:54,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:37:54,615 INFO L82 PathProgramCache]: Analyzing trace with hash -485428597, now seen corresponding path program 1 times 362.23/278.91 [2019-03-28 12:37:54,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:37:54,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:37:54,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:37:54,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:37:54,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:37:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:37:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:37:54,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:37:54,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 362.23/278.91 [2019-03-28 12:37:54,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states 362.23/278.91 [2019-03-28 12:37:54,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. 362.23/278.91 [2019-03-28 12:37:54,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 362.23/278.91 [2019-03-28 12:37:54,880 INFO L87 Difference]: Start difference. First operand 80 states and 108 transitions. Second operand 13 states. 362.23/278.91 [2019-03-28 12:37:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:37:55,513 INFO L93 Difference]: Finished difference Result 89 states and 119 transitions. 362.23/278.91 [2019-03-28 12:37:55,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 362.23/278.91 [2019-03-28 12:37:55,514 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 362.23/278.91 [2019-03-28 12:37:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:37:55,515 INFO L225 Difference]: With dead ends: 89 362.23/278.91 [2019-03-28 12:37:55,515 INFO L226 Difference]: Without dead ends: 88 362.23/278.91 [2019-03-28 12:37:55,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 362.23/278.91 [2019-03-28 12:37:55,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. 362.23/278.91 [2019-03-28 12:37:55,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. 362.23/278.91 [2019-03-28 12:37:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. 362.23/278.91 [2019-03-28 12:37:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 109 transitions. 362.23/278.91 [2019-03-28 12:37:55,525 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 109 transitions. Word has length 19 362.23/278.91 [2019-03-28 12:37:55,525 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:37:55,525 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 109 transitions. 362.23/278.91 [2019-03-28 12:37:55,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. 362.23/278.91 [2019-03-28 12:37:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. 362.23/278.91 [2019-03-28 12:37:55,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 362.23/278.91 [2019-03-28 12:37:55,526 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:37:55,526 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:37:55,526 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:37:55,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:37:55,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1175808476, now seen corresponding path program 1 times 362.23/278.91 [2019-03-28 12:37:55,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:37:55,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:37:55,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:37:55,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:37:55,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:37:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:37:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:37:55,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.91 [2019-03-28 12:37:55,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.91 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.91 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.91 [2019-03-28 12:37:55,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:37:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:37:55,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 33 conjunts are in the unsatisfiable core 362.23/278.91 [2019-03-28 12:37:55,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.91 [2019-03-28 12:37:55,884 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 362.23/278.91 [2019-03-28 12:37:55,885 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:55,895 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:37:55,896 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:55,896 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 362.23/278.91 [2019-03-28 12:37:55,952 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:37:55,953 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 362.23/278.91 [2019-03-28 12:37:55,953 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:55,968 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:37:55,975 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 362.23/278.91 [2019-03-28 12:37:55,975 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:56,009 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:37:56,010 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:56,011 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:33 362.23/278.91 [2019-03-28 12:37:56,066 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 362.23/278.91 [2019-03-28 12:37:56,067 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:56,080 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:37:56,082 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:56,082 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:33 362.23/278.91 [2019-03-28 12:37:56,183 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 362.23/278.91 [2019-03-28 12:37:56,184 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:56,198 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:37:56,199 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:56,199 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:33 362.23/278.91 [2019-03-28 12:37:56,327 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:37:56,328 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 362.23/278.91 [2019-03-28 12:37:56,332 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 362.23/278.91 [2019-03-28 12:37:56,349 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:37:56,356 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:56,356 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:33 362.23/278.91 [2019-03-28 12:37:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:37:56,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:37:56,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 362.23/278.91 [2019-03-28 12:37:56,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states 362.23/278.91 [2019-03-28 12:37:56,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. 362.23/278.91 [2019-03-28 12:37:56,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 362.23/278.91 [2019-03-28 12:37:56,586 INFO L87 Difference]: Start difference. First operand 81 states and 109 transitions. Second operand 22 states. 362.23/278.91 [2019-03-28 12:37:57,255 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 362.23/278.91 [2019-03-28 12:37:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:37:57,688 INFO L93 Difference]: Finished difference Result 95 states and 131 transitions. 362.23/278.91 [2019-03-28 12:37:57,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 362.23/278.91 [2019-03-28 12:37:57,689 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 19 362.23/278.91 [2019-03-28 12:37:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:37:57,692 INFO L225 Difference]: With dead ends: 95 362.23/278.91 [2019-03-28 12:37:57,692 INFO L226 Difference]: Without dead ends: 94 362.23/278.91 [2019-03-28 12:37:57,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=176, Invalid=816, Unknown=0, NotChecked=0, Total=992 362.23/278.91 [2019-03-28 12:37:57,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. 362.23/278.91 [2019-03-28 12:37:57,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. 362.23/278.91 [2019-03-28 12:37:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. 362.23/278.91 [2019-03-28 12:37:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. 362.23/278.91 [2019-03-28 12:37:57,706 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 19 362.23/278.91 [2019-03-28 12:37:57,707 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:37:57,707 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. 362.23/278.91 [2019-03-28 12:37:57,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. 362.23/278.91 [2019-03-28 12:37:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. 362.23/278.91 [2019-03-28 12:37:57,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 362.23/278.91 [2019-03-28 12:37:57,708 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:37:57,708 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:37:57,708 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:37:57,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:37:57,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1174884955, now seen corresponding path program 1 times 362.23/278.91 [2019-03-28 12:37:57,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:37:57,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:37:57,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:37:57,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:37:57,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:37:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:37:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:37:57,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.91 [2019-03-28 12:37:57,995 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.91 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.91 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.91 [2019-03-28 12:37:58,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:37:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:37:58,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 33 conjunts are in the unsatisfiable core 362.23/278.91 [2019-03-28 12:37:58,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.91 [2019-03-28 12:37:58,066 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 362.23/278.91 [2019-03-28 12:37:58,066 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:58,085 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 362.23/278.91 [2019-03-28 12:37:58,086 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:58,105 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:37:58,106 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. 362.23/278.91 [2019-03-28 12:37:58,106 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 362.23/278.91 [2019-03-28 12:37:58,171 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:37:58,171 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 362.23/278.91 [2019-03-28 12:37:58,172 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:58,196 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:37:58,196 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 362.23/278.91 [2019-03-28 12:37:58,197 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:58,225 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:37:58,234 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 362.23/278.91 [2019-03-28 12:37:58,234 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:58,242 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 362.23/278.91 [2019-03-28 12:37:58,243 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:58,272 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:37:58,274 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. 362.23/278.91 [2019-03-28 12:37:58,274 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:75, output treesize:61 362.23/278.91 [2019-03-28 12:37:58,332 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 362.23/278.91 [2019-03-28 12:37:58,333 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:58,344 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:37:58,345 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:58,345 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:27 362.23/278.91 [2019-03-28 12:37:58,419 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 362.23/278.91 [2019-03-28 12:37:58,420 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:58,429 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:37:58,430 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:58,430 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:27 362.23/278.91 [2019-03-28 12:37:58,515 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:37:58,516 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 362.23/278.91 [2019-03-28 12:37:58,517 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 362.23/278.91 [2019-03-28 12:37:58,531 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:37:58,534 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:37:58,534 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 362.23/278.91 [2019-03-28 12:37:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:37:58,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:37:58,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 362.23/278.91 [2019-03-28 12:37:58,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states 362.23/278.91 [2019-03-28 12:37:58,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. 362.23/278.91 [2019-03-28 12:37:58,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 362.23/278.91 [2019-03-28 12:37:58,727 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand 22 states. 362.23/278.91 [2019-03-28 12:37:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:37:59,782 INFO L93 Difference]: Finished difference Result 103 states and 141 transitions. 362.23/278.91 [2019-03-28 12:37:59,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 362.23/278.91 [2019-03-28 12:37:59,782 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 19 362.23/278.91 [2019-03-28 12:37:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:37:59,783 INFO L225 Difference]: With dead ends: 103 362.23/278.91 [2019-03-28 12:37:59,783 INFO L226 Difference]: Without dead ends: 102 362.23/278.91 [2019-03-28 12:37:59,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=176, Invalid=816, Unknown=0, NotChecked=0, Total=992 362.23/278.91 [2019-03-28 12:37:59,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. 362.23/278.91 [2019-03-28 12:37:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. 362.23/278.91 [2019-03-28 12:37:59,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. 362.23/278.91 [2019-03-28 12:37:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. 362.23/278.91 [2019-03-28 12:37:59,795 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 19 362.23/278.91 [2019-03-28 12:37:59,796 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:37:59,796 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. 362.23/278.91 [2019-03-28 12:37:59,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. 362.23/278.91 [2019-03-28 12:37:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. 362.23/278.91 [2019-03-28 12:37:59,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 362.23/278.91 [2019-03-28 12:37:59,796 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:37:59,797 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:37:59,797 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:37:59,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:37:59,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2090327423, now seen corresponding path program 1 times 362.23/278.91 [2019-03-28 12:37:59,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:37:59,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:37:59,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:37:59,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:37:59,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:37:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:37:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:37:59,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.91 [2019-03-28 12:37:59,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.91 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.91 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.91 [2019-03-28 12:37:59,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:00,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 45 conjunts are in the unsatisfiable core 362.23/278.91 [2019-03-28 12:38:00,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.91 [2019-03-28 12:38:00,029 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:00,030 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.91 [2019-03-28 12:38:00,031 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:00,039 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:00,040 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:00,040 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 362.23/278.91 [2019-03-28 12:38:00,067 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:00,068 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 362.23/278.91 [2019-03-28 12:38:00,068 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:00,078 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:00,078 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:00,078 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 362.23/278.91 [2019-03-28 12:38:00,111 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:38:00,112 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:00,126 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:00,130 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:38:00,130 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:00,143 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:00,144 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:00,144 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:35 362.23/278.91 [2019-03-28 12:38:00,178 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 362.23/278.91 [2019-03-28 12:38:00,179 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:00,190 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:00,192 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 362.23/278.91 [2019-03-28 12:38:00,193 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:00,202 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:00,202 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:00,203 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:23 362.23/278.91 [2019-03-28 12:38:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:00,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:38:00,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 362.23/278.91 [2019-03-28 12:38:00,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states 362.23/278.91 [2019-03-28 12:38:00,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. 362.23/278.91 [2019-03-28 12:38:00,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 362.23/278.91 [2019-03-28 12:38:00,390 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand 21 states. 362.23/278.91 [2019-03-28 12:38:03,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:38:03,186 INFO L93 Difference]: Finished difference Result 160 states and 202 transitions. 362.23/278.91 [2019-03-28 12:38:03,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. 362.23/278.91 [2019-03-28 12:38:03,201 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 362.23/278.91 [2019-03-28 12:38:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:38:03,202 INFO L225 Difference]: With dead ends: 160 362.23/278.91 [2019-03-28 12:38:03,202 INFO L226 Difference]: Without dead ends: 159 362.23/278.91 [2019-03-28 12:38:03,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=576, Invalid=2504, Unknown=0, NotChecked=0, Total=3080 362.23/278.91 [2019-03-28 12:38:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. 362.23/278.91 [2019-03-28 12:38:03,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 94. 362.23/278.91 [2019-03-28 12:38:03,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. 362.23/278.91 [2019-03-28 12:38:03,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. 362.23/278.91 [2019-03-28 12:38:03,216 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 125 transitions. Word has length 20 362.23/278.91 [2019-03-28 12:38:03,216 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:38:03,216 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 125 transitions. 362.23/278.91 [2019-03-28 12:38:03,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. 362.23/278.91 [2019-03-28 12:38:03,216 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 125 transitions. 362.23/278.91 [2019-03-28 12:38:03,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 362.23/278.91 [2019-03-28 12:38:03,217 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:38:03,217 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:38:03,217 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:38:03,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:38:03,218 INFO L82 PathProgramCache]: Analyzing trace with hash -2090297632, now seen corresponding path program 1 times 362.23/278.91 [2019-03-28 12:38:03,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:38:03,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:38:03,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:03,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:03,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:03,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:03,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:38:03,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 362.23/278.91 [2019-03-28 12:38:03,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 362.23/278.91 [2019-03-28 12:38:03,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 362.23/278.91 [2019-03-28 12:38:03,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 362.23/278.91 [2019-03-28 12:38:03,246 INFO L87 Difference]: Start difference. First operand 94 states and 125 transitions. Second operand 4 states. 362.23/278.91 [2019-03-28 12:38:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:38:03,312 INFO L93 Difference]: Finished difference Result 123 states and 166 transitions. 362.23/278.91 [2019-03-28 12:38:03,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 362.23/278.91 [2019-03-28 12:38:03,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 362.23/278.91 [2019-03-28 12:38:03,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:38:03,313 INFO L225 Difference]: With dead ends: 123 362.23/278.91 [2019-03-28 12:38:03,313 INFO L226 Difference]: Without dead ends: 92 362.23/278.91 [2019-03-28 12:38:03,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 362.23/278.91 [2019-03-28 12:38:03,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. 362.23/278.91 [2019-03-28 12:38:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. 362.23/278.91 [2019-03-28 12:38:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. 362.23/278.91 [2019-03-28 12:38:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. 362.23/278.91 [2019-03-28 12:38:03,324 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 20 362.23/278.91 [2019-03-28 12:38:03,324 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:38:03,324 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. 362.23/278.91 [2019-03-28 12:38:03,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 362.23/278.91 [2019-03-28 12:38:03,324 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. 362.23/278.91 [2019-03-28 12:38:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 362.23/278.91 [2019-03-28 12:38:03,325 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:38:03,325 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:38:03,325 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:38:03,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:38:03,326 INFO L82 PathProgramCache]: Analyzing trace with hash -582775614, now seen corresponding path program 1 times 362.23/278.91 [2019-03-28 12:38:03,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:38:03,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:38:03,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:03,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:03,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:03,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:03,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.91 [2019-03-28 12:38:03,569 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.91 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.91 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.91 [2019-03-28 12:38:03,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:03,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 34 conjunts are in the unsatisfiable core 362.23/278.91 [2019-03-28 12:38:03,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.91 [2019-03-28 12:38:03,615 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:03,617 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.91 [2019-03-28 12:38:03,617 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:03,629 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:03,633 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:03,634 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.91 [2019-03-28 12:38:03,634 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:03,647 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:03,648 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:03,648 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:25 362.23/278.91 [2019-03-28 12:38:03,685 INFO L388 ElimStorePlain]: Different consts {1=[|v_#length_39|], 3=[|v_#valid_51|]} 362.23/278.91 [2019-03-28 12:38:03,691 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:03,692 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 362.23/278.91 [2019-03-28 12:38:03,692 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:03,710 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:03,714 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:03,716 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:03,720 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:03,721 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 362.23/278.91 [2019-03-28 12:38:03,721 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:03,732 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:03,733 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:03,733 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 362.23/278.91 [2019-03-28 12:38:03,769 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:38:03,769 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:03,784 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:03,788 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:38:03,788 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:03,801 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:03,802 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:03,802 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:40 362.23/278.91 [2019-03-28 12:38:03,839 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 362.23/278.91 [2019-03-28 12:38:03,839 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:03,851 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:03,854 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 362.23/278.91 [2019-03-28 12:38:03,855 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:03,865 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:03,865 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:03,866 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:24 362.23/278.91 [2019-03-28 12:38:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:04,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:38:04,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 362.23/278.91 [2019-03-28 12:38:04,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states 362.23/278.91 [2019-03-28 12:38:04,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. 362.23/278.91 [2019-03-28 12:38:04,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 362.23/278.91 [2019-03-28 12:38:04,074 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand 21 states. 362.23/278.91 [2019-03-28 12:38:04,899 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 362.23/278.91 [2019-03-28 12:38:05,236 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 362.23/278.91 [2019-03-28 12:38:07,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:38:07,405 INFO L93 Difference]: Finished difference Result 186 states and 239 transitions. 362.23/278.91 [2019-03-28 12:38:07,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. 362.23/278.91 [2019-03-28 12:38:07,405 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 362.23/278.91 [2019-03-28 12:38:07,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:38:07,406 INFO L225 Difference]: With dead ends: 186 362.23/278.91 [2019-03-28 12:38:07,407 INFO L226 Difference]: Without dead ends: 185 362.23/278.91 [2019-03-28 12:38:07,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=447, Invalid=2309, Unknown=0, NotChecked=0, Total=2756 362.23/278.91 [2019-03-28 12:38:07,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. 362.23/278.91 [2019-03-28 12:38:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 93. 362.23/278.91 [2019-03-28 12:38:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. 362.23/278.91 [2019-03-28 12:38:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. 362.23/278.91 [2019-03-28 12:38:07,420 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 20 362.23/278.91 [2019-03-28 12:38:07,420 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:38:07,420 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. 362.23/278.91 [2019-03-28 12:38:07,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. 362.23/278.91 [2019-03-28 12:38:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. 362.23/278.91 [2019-03-28 12:38:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 362.23/278.91 [2019-03-28 12:38:07,421 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:38:07,421 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:38:07,421 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:38:07,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:38:07,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1601310720, now seen corresponding path program 1 times 362.23/278.91 [2019-03-28 12:38:07,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:38:07,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:38:07,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:07,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:07,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:07,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:07,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.91 [2019-03-28 12:38:07,454 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.91 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.91 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.91 [2019-03-28 12:38:07,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:07,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjunts are in the unsatisfiable core 362.23/278.91 [2019-03-28 12:38:07,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.91 [2019-03-28 12:38:07,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:07,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:38:07,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 362.23/278.91 [2019-03-28 12:38:07,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 362.23/278.91 [2019-03-28 12:38:07,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 362.23/278.91 [2019-03-28 12:38:07,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 362.23/278.91 [2019-03-28 12:38:07,543 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand 5 states. 362.23/278.91 [2019-03-28 12:38:07,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:38:07,653 INFO L93 Difference]: Finished difference Result 107 states and 141 transitions. 362.23/278.91 [2019-03-28 12:38:07,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 362.23/278.91 [2019-03-28 12:38:07,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 362.23/278.91 [2019-03-28 12:38:07,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:38:07,654 INFO L225 Difference]: With dead ends: 107 362.23/278.91 [2019-03-28 12:38:07,654 INFO L226 Difference]: Without dead ends: 84 362.23/278.91 [2019-03-28 12:38:07,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 362.23/278.91 [2019-03-28 12:38:07,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. 362.23/278.91 [2019-03-28 12:38:07,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. 362.23/278.91 [2019-03-28 12:38:07,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. 362.23/278.91 [2019-03-28 12:38:07,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. 362.23/278.91 [2019-03-28 12:38:07,666 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 110 transitions. Word has length 22 362.23/278.91 [2019-03-28 12:38:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:38:07,666 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 110 transitions. 362.23/278.91 [2019-03-28 12:38:07,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 362.23/278.91 [2019-03-28 12:38:07,667 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. 362.23/278.91 [2019-03-28 12:38:07,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 362.23/278.91 [2019-03-28 12:38:07,667 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:38:07,667 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:38:07,678 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:38:07,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:38:07,679 INFO L82 PathProgramCache]: Analyzing trace with hash -248001054, now seen corresponding path program 1 times 362.23/278.91 [2019-03-28 12:38:07,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:38:07,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:38:07,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:07,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:07,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:08,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:08,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.91 [2019-03-28 12:38:08,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.91 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.91 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.91 [2019-03-28 12:38:08,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:08,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 42 conjunts are in the unsatisfiable core 362.23/278.91 [2019-03-28 12:38:08,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.91 [2019-03-28 12:38:08,055 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:08,056 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.91 [2019-03-28 12:38:08,057 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:08,070 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:08,086 INFO L340 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size 362.23/278.91 [2019-03-28 12:38:08,087 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 362.23/278.91 [2019-03-28 12:38:08,087 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:08,098 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:08,099 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:08,099 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:26 362.23/278.91 [2019-03-28 12:38:08,131 INFO L388 ElimStorePlain]: Different consts {1=[|v_#length_41|], 3=[|v_#valid_53|]} 362.23/278.91 [2019-03-28 12:38:08,135 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:08,136 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 362.23/278.91 [2019-03-28 12:38:08,136 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:08,151 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:08,155 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:08,160 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:08,160 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 362.23/278.91 [2019-03-28 12:38:08,161 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:08,172 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:08,172 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:08,173 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 362.23/278.91 [2019-03-28 12:38:08,206 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:38:08,206 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:08,235 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:08,238 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:38:08,239 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:08,250 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:08,251 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:08,251 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 362.23/278.91 [2019-03-28 12:38:08,286 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 362.23/278.91 [2019-03-28 12:38:08,287 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:08,298 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:08,300 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 362.23/278.91 [2019-03-28 12:38:08,301 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:08,308 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:08,309 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:08,309 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:21 362.23/278.91 [2019-03-28 12:38:08,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:08,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:38:08,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 24 362.23/278.91 [2019-03-28 12:38:08,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states 362.23/278.91 [2019-03-28 12:38:08,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. 362.23/278.91 [2019-03-28 12:38:08,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 362.23/278.91 [2019-03-28 12:38:08,530 INFO L87 Difference]: Start difference. First operand 83 states and 110 transitions. Second operand 25 states. 362.23/278.91 [2019-03-28 12:38:11,387 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 362.23/278.91 [2019-03-28 12:38:13,444 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 362.23/278.91 [2019-03-28 12:38:14,559 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 362.23/278.91 [2019-03-28 12:38:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:38:14,867 INFO L93 Difference]: Finished difference Result 290 states and 375 transitions. 362.23/278.91 [2019-03-28 12:38:14,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. 362.23/278.91 [2019-03-28 12:38:14,867 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 22 362.23/278.91 [2019-03-28 12:38:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:38:14,869 INFO L225 Difference]: With dead ends: 290 362.23/278.91 [2019-03-28 12:38:14,869 INFO L226 Difference]: Without dead ends: 289 362.23/278.91 [2019-03-28 12:38:14,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2077 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1296, Invalid=6014, Unknown=0, NotChecked=0, Total=7310 362.23/278.91 [2019-03-28 12:38:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. 362.23/278.91 [2019-03-28 12:38:14,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 148. 362.23/278.91 [2019-03-28 12:38:14,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. 362.23/278.91 [2019-03-28 12:38:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 197 transitions. 362.23/278.91 [2019-03-28 12:38:14,891 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 197 transitions. Word has length 22 362.23/278.91 [2019-03-28 12:38:14,891 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:38:14,891 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 197 transitions. 362.23/278.91 [2019-03-28 12:38:14,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. 362.23/278.91 [2019-03-28 12:38:14,892 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 197 transitions. 362.23/278.91 [2019-03-28 12:38:14,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 362.23/278.91 [2019-03-28 12:38:14,892 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:38:14,892 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:38:14,893 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:38:14,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:38:14,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1810531179, now seen corresponding path program 1 times 362.23/278.91 [2019-03-28 12:38:14,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:38:14,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:38:14,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:14,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:14,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:15,249 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:15,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.91 [2019-03-28 12:38:15,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.91 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.91 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.91 [2019-03-28 12:38:15,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:15,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 49 conjunts are in the unsatisfiable core 362.23/278.91 [2019-03-28 12:38:15,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.91 [2019-03-28 12:38:15,314 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:15,315 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.91 [2019-03-28 12:38:15,316 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:15,328 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:15,348 INFO L340 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size 362.23/278.91 [2019-03-28 12:38:15,349 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 362.23/278.91 [2019-03-28 12:38:15,349 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:15,361 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:15,361 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:15,362 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:26 362.23/278.91 [2019-03-28 12:38:15,394 INFO L388 ElimStorePlain]: Different consts {1=[|v_#length_43|], 3=[|v_#valid_55|]} 362.23/278.91 [2019-03-28 12:38:15,398 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:15,399 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 362.23/278.91 [2019-03-28 12:38:15,400 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:15,417 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:15,421 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:15,426 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:15,426 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 362.23/278.91 [2019-03-28 12:38:15,427 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:15,437 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:15,438 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:15,438 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 362.23/278.91 [2019-03-28 12:38:15,471 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:38:15,471 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:15,484 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:15,487 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:38:15,487 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:15,498 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:15,499 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:15,499 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 362.23/278.91 [2019-03-28 12:38:15,535 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 362.23/278.91 [2019-03-28 12:38:15,535 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:15,544 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:15,547 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 362.23/278.91 [2019-03-28 12:38:15,547 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:15,555 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:15,555 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:15,555 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:21 362.23/278.91 [2019-03-28 12:38:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:15,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:38:15,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 28 362.23/278.91 [2019-03-28 12:38:15,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states 362.23/278.91 [2019-03-28 12:38:15,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. 362.23/278.91 [2019-03-28 12:38:15,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 362.23/278.91 [2019-03-28 12:38:15,858 INFO L87 Difference]: Start difference. First operand 148 states and 197 transitions. Second operand 29 states. 362.23/278.91 [2019-03-28 12:38:19,014 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 362.23/278.91 [2019-03-28 12:38:23,404 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 362.23/278.91 [2019-03-28 12:38:24,335 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 362.23/278.91 [2019-03-28 12:38:24,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:38:24,775 INFO L93 Difference]: Finished difference Result 490 states and 649 transitions. 362.23/278.91 [2019-03-28 12:38:24,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. 362.23/278.91 [2019-03-28 12:38:24,776 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 362.23/278.91 [2019-03-28 12:38:24,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:38:24,778 INFO L225 Difference]: With dead ends: 490 362.23/278.91 [2019-03-28 12:38:24,779 INFO L226 Difference]: Without dead ends: 489 362.23/278.91 [2019-03-28 12:38:24,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3982 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2149, Invalid=10283, Unknown=0, NotChecked=0, Total=12432 362.23/278.91 [2019-03-28 12:38:24,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. 362.23/278.91 [2019-03-28 12:38:24,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 198. 362.23/278.91 [2019-03-28 12:38:24,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. 362.23/278.91 [2019-03-28 12:38:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 263 transitions. 362.23/278.91 [2019-03-28 12:38:24,814 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 263 transitions. Word has length 25 362.23/278.91 [2019-03-28 12:38:24,815 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:38:24,815 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 263 transitions. 362.23/278.91 [2019-03-28 12:38:24,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. 362.23/278.91 [2019-03-28 12:38:24,815 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 263 transitions. 362.23/278.91 [2019-03-28 12:38:24,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 362.23/278.91 [2019-03-28 12:38:24,816 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:38:24,816 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:38:24,816 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:38:24,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:38:24,816 INFO L82 PathProgramCache]: Analyzing trace with hash -2086116643, now seen corresponding path program 1 times 362.23/278.91 [2019-03-28 12:38:24,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:38:24,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:38:24,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:24,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:24,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:24,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:38:24,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 362.23/278.91 [2019-03-28 12:38:24,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 362.23/278.91 [2019-03-28 12:38:24,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 362.23/278.91 [2019-03-28 12:38:24,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 362.23/278.91 [2019-03-28 12:38:24,858 INFO L87 Difference]: Start difference. First operand 198 states and 263 transitions. Second operand 5 states. 362.23/278.91 [2019-03-28 12:38:24,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:38:24,964 INFO L93 Difference]: Finished difference Result 279 states and 379 transitions. 362.23/278.91 [2019-03-28 12:38:24,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 362.23/278.91 [2019-03-28 12:38:24,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 362.23/278.91 [2019-03-28 12:38:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:38:24,966 INFO L225 Difference]: With dead ends: 279 362.23/278.91 [2019-03-28 12:38:24,966 INFO L226 Difference]: Without dead ends: 244 362.23/278.91 [2019-03-28 12:38:24,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 362.23/278.91 [2019-03-28 12:38:24,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. 362.23/278.91 [2019-03-28 12:38:24,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 219. 362.23/278.91 [2019-03-28 12:38:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. 362.23/278.91 [2019-03-28 12:38:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 303 transitions. 362.23/278.91 [2019-03-28 12:38:24,998 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 303 transitions. Word has length 25 362.23/278.91 [2019-03-28 12:38:24,998 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:38:24,998 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 303 transitions. 362.23/278.91 [2019-03-28 12:38:24,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 362.23/278.91 [2019-03-28 12:38:24,999 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 303 transitions. 362.23/278.91 [2019-03-28 12:38:24,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 362.23/278.91 [2019-03-28 12:38:24,999 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:38:24,999 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:38:25,000 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:38:25,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:38:25,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1976828021, now seen corresponding path program 2 times 362.23/278.91 [2019-03-28 12:38:25,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:38:25,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:38:25,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:25,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:25,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:25,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.91 [2019-03-28 12:38:25,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.91 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.91 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.91 [2019-03-28 12:38:25,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 362.23/278.91 [2019-03-28 12:38:25,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 362.23/278.91 [2019-03-28 12:38:25,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:25,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 48 conjunts are in the unsatisfiable core 362.23/278.91 [2019-03-28 12:38:25,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.91 [2019-03-28 12:38:25,479 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:25,480 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.91 [2019-03-28 12:38:25,481 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:25,489 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:25,493 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 362.23/278.91 [2019-03-28 12:38:25,493 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:25,502 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:25,502 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:25,503 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 362.23/278.91 [2019-03-28 12:38:25,532 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 362.23/278.91 [2019-03-28 12:38:25,532 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:25,541 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:25,542 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:25,542 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 362.23/278.91 [2019-03-28 12:38:25,586 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:25,586 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 362.23/278.91 [2019-03-28 12:38:25,587 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:25,597 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:25,599 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 362.23/278.91 [2019-03-28 12:38:25,600 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:25,610 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:25,611 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:25,611 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 362.23/278.91 [2019-03-28 12:38:25,652 INFO L388 ElimStorePlain]: Different consts {0=[|v_#memory_$Pointer$.base_31|], 2=[|v_#memory_int_27|]} 362.23/278.91 [2019-03-28 12:38:25,657 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:38:25,657 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:25,673 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:25,677 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 362.23/278.91 [2019-03-28 12:38:25,677 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:25,689 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:25,689 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:25,690 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 362.23/278.91 [2019-03-28 12:38:25,735 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 362.23/278.91 [2019-03-28 12:38:25,735 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:25,745 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:25,745 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:25,745 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 362.23/278.91 [2019-03-28 12:38:25,791 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 362.23/278.91 [2019-03-28 12:38:25,791 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:25,800 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:25,801 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:25,801 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:32 362.23/278.91 [2019-03-28 12:38:25,898 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 362.23/278.91 [2019-03-28 12:38:25,899 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:25,911 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:25,911 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:25,912 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:43, output treesize:28 362.23/278.91 [2019-03-28 12:38:26,037 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:26,038 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 362.23/278.91 [2019-03-28 12:38:26,039 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 362.23/278.91 [2019-03-28 12:38:26,054 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:26,056 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:26,057 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:33 362.23/278.91 [2019-03-28 12:38:26,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:26,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:38:26,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 362.23/278.91 [2019-03-28 12:38:26,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states 362.23/278.91 [2019-03-28 12:38:26,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. 362.23/278.91 [2019-03-28 12:38:26,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 362.23/278.91 [2019-03-28 12:38:26,286 INFO L87 Difference]: Start difference. First operand 219 states and 303 transitions. Second operand 27 states. 362.23/278.91 [2019-03-28 12:38:26,851 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 362.23/278.91 [2019-03-28 12:38:27,075 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 362.23/278.91 [2019-03-28 12:38:27,257 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 362.23/278.91 [2019-03-28 12:38:27,454 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 82 362.23/278.91 [2019-03-28 12:38:27,700 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 90 362.23/278.91 [2019-03-28 12:38:27,875 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 362.23/278.91 [2019-03-28 12:38:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:38:29,201 INFO L93 Difference]: Finished difference Result 297 states and 403 transitions. 362.23/278.91 [2019-03-28 12:38:29,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 362.23/278.91 [2019-03-28 12:38:29,201 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 25 362.23/278.91 [2019-03-28 12:38:29,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:38:29,203 INFO L225 Difference]: With dead ends: 297 362.23/278.91 [2019-03-28 12:38:29,203 INFO L226 Difference]: Without dead ends: 296 362.23/278.91 [2019-03-28 12:38:29,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=346, Invalid=1724, Unknown=0, NotChecked=0, Total=2070 362.23/278.91 [2019-03-28 12:38:29,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. 362.23/278.91 [2019-03-28 12:38:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 253. 362.23/278.91 [2019-03-28 12:38:29,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. 362.23/278.91 [2019-03-28 12:38:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 343 transitions. 362.23/278.91 [2019-03-28 12:38:29,248 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 343 transitions. Word has length 25 362.23/278.91 [2019-03-28 12:38:29,249 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:38:29,249 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 343 transitions. 362.23/278.91 [2019-03-28 12:38:29,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. 362.23/278.91 [2019-03-28 12:38:29,249 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 343 transitions. 362.23/278.91 [2019-03-28 12:38:29,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 362.23/278.91 [2019-03-28 12:38:29,249 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:38:29,250 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:38:29,250 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:38:29,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:38:29,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1975904500, now seen corresponding path program 1 times 362.23/278.91 [2019-03-28 12:38:29,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:38:29,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:38:29,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:29,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:29,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:29,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.91 [2019-03-28 12:38:29,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.91 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.91 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.91 [2019-03-28 12:38:29,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:29,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 45 conjunts are in the unsatisfiable core 362.23/278.91 [2019-03-28 12:38:29,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.91 [2019-03-28 12:38:29,714 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:29,715 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.91 [2019-03-28 12:38:29,715 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:29,724 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:29,725 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:29,725 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 362.23/278.91 [2019-03-28 12:38:29,755 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 362.23/278.91 [2019-03-28 12:38:29,756 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:29,762 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:29,763 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:29,763 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 362.23/278.91 [2019-03-28 12:38:29,799 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:29,799 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 362.23/278.91 [2019-03-28 12:38:29,815 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:29,823 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:29,826 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 362.23/278.91 [2019-03-28 12:38:29,826 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:29,834 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:29,834 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:29,834 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 362.23/278.91 [2019-03-28 12:38:29,868 INFO L388 ElimStorePlain]: Different consts {0=[|v_#memory_$Pointer$.base_32|], 2=[|v_#memory_int_31|]} 362.23/278.91 [2019-03-28 12:38:29,871 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:38:29,872 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:29,884 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:29,888 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 362.23/278.91 [2019-03-28 12:38:29,888 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:29,898 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:29,898 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:29,898 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 362.23/278.91 [2019-03-28 12:38:29,937 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 362.23/278.91 [2019-03-28 12:38:29,938 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:29,946 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:29,946 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:29,946 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:29 362.23/278.91 [2019-03-28 12:38:29,985 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 362.23/278.91 [2019-03-28 12:38:29,986 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:29,993 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:29,994 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:29,994 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 362.23/278.91 [2019-03-28 12:38:30,077 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:30,078 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 362.23/278.91 [2019-03-28 12:38:30,078 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:30,088 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:30,089 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:30,089 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:40, output treesize:24 362.23/278.91 [2019-03-28 12:38:30,184 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:30,185 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 362.23/278.91 [2019-03-28 12:38:30,186 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 362.23/278.91 [2019-03-28 12:38:30,197 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:30,199 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:30,199 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 362.23/278.91 [2019-03-28 12:38:30,387 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:30,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:38:30,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 362.23/278.91 [2019-03-28 12:38:30,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states 362.23/278.91 [2019-03-28 12:38:30,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. 362.23/278.91 [2019-03-28 12:38:30,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 362.23/278.91 [2019-03-28 12:38:30,416 INFO L87 Difference]: Start difference. First operand 253 states and 343 transitions. Second operand 27 states. 362.23/278.91 [2019-03-28 12:38:31,000 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 362.23/278.91 [2019-03-28 12:38:31,330 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 85 362.23/278.91 [2019-03-28 12:38:31,484 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 362.23/278.91 [2019-03-28 12:38:31,668 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 362.23/278.91 [2019-03-28 12:38:31,986 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 77 362.23/278.91 [2019-03-28 12:38:32,346 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 85 362.23/278.91 [2019-03-28 12:38:32,550 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 362.23/278.91 [2019-03-28 12:38:32,873 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 362.23/278.91 [2019-03-28 12:38:33,095 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 362.23/278.91 [2019-03-28 12:38:33,380 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 74 362.23/278.91 [2019-03-28 12:38:33,556 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 73 362.23/278.91 [2019-03-28 12:38:33,836 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 77 362.23/278.91 [2019-03-28 12:38:34,561 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 362.23/278.91 [2019-03-28 12:38:34,713 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 69 362.23/278.91 [2019-03-28 12:38:34,937 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 362.23/278.91 [2019-03-28 12:38:35,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:38:35,104 INFO L93 Difference]: Finished difference Result 460 states and 612 transitions. 362.23/278.91 [2019-03-28 12:38:35,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 362.23/278.91 [2019-03-28 12:38:35,105 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 25 362.23/278.91 [2019-03-28 12:38:35,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:38:35,107 INFO L225 Difference]: With dead ends: 460 362.23/278.91 [2019-03-28 12:38:35,107 INFO L226 Difference]: Without dead ends: 459 362.23/278.91 [2019-03-28 12:38:35,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=525, Invalid=2781, Unknown=0, NotChecked=0, Total=3306 362.23/278.91 [2019-03-28 12:38:35,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. 362.23/278.91 [2019-03-28 12:38:35,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 319. 362.23/278.91 [2019-03-28 12:38:35,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. 362.23/278.91 [2019-03-28 12:38:35,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 442 transitions. 362.23/278.91 [2019-03-28 12:38:35,178 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 442 transitions. Word has length 25 362.23/278.91 [2019-03-28 12:38:35,178 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:38:35,178 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 442 transitions. 362.23/278.91 [2019-03-28 12:38:35,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. 362.23/278.91 [2019-03-28 12:38:35,178 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 442 transitions. 362.23/278.91 [2019-03-28 12:38:35,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 362.23/278.91 [2019-03-28 12:38:35,179 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:38:35,179 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:38:35,179 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:38:35,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:38:35,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1152099751, now seen corresponding path program 1 times 362.23/278.91 [2019-03-28 12:38:35,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:38:35,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:38:35,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:35,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:35,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:35,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.91 [2019-03-28 12:38:35,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.91 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.91 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.91 [2019-03-28 12:38:35,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:35,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjunts are in the unsatisfiable core 362.23/278.91 [2019-03-28 12:38:35,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.91 [2019-03-28 12:38:35,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:35,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:38:35,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 362.23/278.91 [2019-03-28 12:38:35,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 362.23/278.91 [2019-03-28 12:38:35,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 362.23/278.91 [2019-03-28 12:38:35,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 362.23/278.91 [2019-03-28 12:38:35,301 INFO L87 Difference]: Start difference. First operand 319 states and 442 transitions. Second operand 5 states. 362.23/278.91 [2019-03-28 12:38:35,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:38:35,415 INFO L93 Difference]: Finished difference Result 413 states and 572 transitions. 362.23/278.91 [2019-03-28 12:38:35,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 362.23/278.91 [2019-03-28 12:38:35,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 362.23/278.91 [2019-03-28 12:38:35,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:38:35,417 INFO L225 Difference]: With dead ends: 413 362.23/278.91 [2019-03-28 12:38:35,417 INFO L226 Difference]: Without dead ends: 235 362.23/278.91 [2019-03-28 12:38:35,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 362.23/278.91 [2019-03-28 12:38:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. 362.23/278.91 [2019-03-28 12:38:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 229. 362.23/278.91 [2019-03-28 12:38:35,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. 362.23/278.91 [2019-03-28 12:38:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 289 transitions. 362.23/278.91 [2019-03-28 12:38:35,454 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 289 transitions. Word has length 26 362.23/278.91 [2019-03-28 12:38:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:38:35,454 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 289 transitions. 362.23/278.91 [2019-03-28 12:38:35,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 362.23/278.91 [2019-03-28 12:38:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 289 transitions. 362.23/278.91 [2019-03-28 12:38:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 362.23/278.91 [2019-03-28 12:38:35,455 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:38:35,455 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:38:35,455 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:38:35,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:38:35,456 INFO L82 PathProgramCache]: Analyzing trace with hash -940778629, now seen corresponding path program 2 times 362.23/278.91 [2019-03-28 12:38:35,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:38:35,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:38:35,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:35,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:35,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:35,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.91 [2019-03-28 12:38:35,809 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.91 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.91 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.91 [2019-03-28 12:38:35,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 362.23/278.91 [2019-03-28 12:38:35,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 362.23/278.91 [2019-03-28 12:38:35,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:35,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 42 conjunts are in the unsatisfiable core 362.23/278.91 [2019-03-28 12:38:35,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.91 [2019-03-28 12:38:35,879 INFO L340 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size 362.23/278.91 [2019-03-28 12:38:35,880 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 362.23/278.91 [2019-03-28 12:38:35,880 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:35,890 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:35,893 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.91 [2019-03-28 12:38:35,893 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:35,904 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:35,904 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:35,905 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:26 362.23/278.91 [2019-03-28 12:38:35,937 INFO L388 ElimStorePlain]: Different consts {1=[|v_#length_49|], 3=[|v_#valid_60|]} 362.23/278.91 [2019-03-28 12:38:35,940 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:35,941 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 362.23/278.91 [2019-03-28 12:38:35,941 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:35,956 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:35,960 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:35,964 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:35,964 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 362.23/278.91 [2019-03-28 12:38:35,964 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:35,975 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:35,975 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:35,975 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 362.23/278.91 [2019-03-28 12:38:36,008 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:38:36,009 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:36,021 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:36,024 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:38:36,024 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:36,036 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:36,037 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:36,037 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 362.23/278.91 [2019-03-28 12:38:36,072 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 362.23/278.91 [2019-03-28 12:38:36,073 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:36,082 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:36,085 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 362.23/278.91 [2019-03-28 12:38:36,085 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:36,093 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:36,094 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:36,094 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:21 362.23/278.91 [2019-03-28 12:38:36,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:36,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:38:36,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 25 362.23/278.91 [2019-03-28 12:38:36,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states 362.23/278.91 [2019-03-28 12:38:36,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. 362.23/278.91 [2019-03-28 12:38:36,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 362.23/278.91 [2019-03-28 12:38:36,367 INFO L87 Difference]: Start difference. First operand 229 states and 289 transitions. Second operand 26 states. 362.23/278.91 [2019-03-28 12:38:40,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:38:40,821 INFO L93 Difference]: Finished difference Result 355 states and 433 transitions. 362.23/278.91 [2019-03-28 12:38:40,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. 362.23/278.91 [2019-03-28 12:38:40,835 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 362.23/278.91 [2019-03-28 12:38:40,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:38:40,837 INFO L225 Difference]: With dead ends: 355 362.23/278.91 [2019-03-28 12:38:40,837 INFO L226 Difference]: Without dead ends: 354 362.23/278.91 [2019-03-28 12:38:40,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1629 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=866, Invalid=4986, Unknown=0, NotChecked=0, Total=5852 362.23/278.91 [2019-03-28 12:38:40,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. 362.23/278.91 [2019-03-28 12:38:40,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 239. 362.23/278.91 [2019-03-28 12:38:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. 362.23/278.91 [2019-03-28 12:38:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 297 transitions. 362.23/278.91 [2019-03-28 12:38:40,875 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 297 transitions. Word has length 26 362.23/278.91 [2019-03-28 12:38:40,875 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:38:40,875 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 297 transitions. 362.23/278.91 [2019-03-28 12:38:40,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. 362.23/278.91 [2019-03-28 12:38:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 297 transitions. 362.23/278.91 [2019-03-28 12:38:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 362.23/278.91 [2019-03-28 12:38:40,876 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:38:40,876 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:38:40,876 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:38:40,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:38:40,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1714705853, now seen corresponding path program 1 times 362.23/278.91 [2019-03-28 12:38:40,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:38:40,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:38:40,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:40,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:40,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:41,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.91 [2019-03-28 12:38:41,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.91 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.91 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.91 [2019-03-28 12:38:41,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:41,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 52 conjunts are in the unsatisfiable core 362.23/278.91 [2019-03-28 12:38:41,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.91 [2019-03-28 12:38:41,076 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:41,077 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.91 [2019-03-28 12:38:41,077 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:41,085 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:41,086 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:41,086 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:12 362.23/278.91 [2019-03-28 12:38:41,108 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:41,109 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 362.23/278.91 [2019-03-28 12:38:41,109 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:41,117 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:41,118 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:41,118 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 362.23/278.91 [2019-03-28 12:38:41,145 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:38:41,146 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:41,159 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:41,163 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:38:41,163 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:41,176 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:41,176 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:41,177 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 362.23/278.91 [2019-03-28 12:38:41,208 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 362.23/278.91 [2019-03-28 12:38:41,208 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:41,219 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:41,222 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 362.23/278.91 [2019-03-28 12:38:41,222 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:41,230 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:41,231 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:41,231 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:20 362.23/278.91 [2019-03-28 12:38:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:41,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:38:41,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 362.23/278.91 [2019-03-28 12:38:41,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states 362.23/278.91 [2019-03-28 12:38:41,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. 362.23/278.91 [2019-03-28 12:38:41,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 362.23/278.91 [2019-03-28 12:38:41,587 INFO L87 Difference]: Start difference. First operand 239 states and 297 transitions. Second operand 25 states. 362.23/278.91 [2019-03-28 12:38:45,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:38:45,394 INFO L93 Difference]: Finished difference Result 377 states and 454 transitions. 362.23/278.91 [2019-03-28 12:38:45,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. 362.23/278.91 [2019-03-28 12:38:45,395 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 28 362.23/278.91 [2019-03-28 12:38:45,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:38:45,396 INFO L225 Difference]: With dead ends: 377 362.23/278.91 [2019-03-28 12:38:45,396 INFO L226 Difference]: Without dead ends: 301 362.23/278.91 [2019-03-28 12:38:45,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1202 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=710, Invalid=3846, Unknown=0, NotChecked=0, Total=4556 362.23/278.91 [2019-03-28 12:38:45,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. 362.23/278.91 [2019-03-28 12:38:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 249. 362.23/278.91 [2019-03-28 12:38:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. 362.23/278.91 [2019-03-28 12:38:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 306 transitions. 362.23/278.91 [2019-03-28 12:38:45,438 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 306 transitions. Word has length 28 362.23/278.91 [2019-03-28 12:38:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:38:45,438 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 306 transitions. 362.23/278.91 [2019-03-28 12:38:45,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. 362.23/278.91 [2019-03-28 12:38:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 306 transitions. 362.23/278.91 [2019-03-28 12:38:45,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 362.23/278.91 [2019-03-28 12:38:45,439 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:38:45,439 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:38:45,439 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:38:45,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:38:45,439 INFO L82 PathProgramCache]: Analyzing trace with hash -741712381, now seen corresponding path program 1 times 362.23/278.91 [2019-03-28 12:38:45,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:38:45,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:38:45,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:45,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:45,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:45,867 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:45,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.91 [2019-03-28 12:38:45,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.91 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.91 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.91 [2019-03-28 12:38:45,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:45,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 56 conjunts are in the unsatisfiable core 362.23/278.91 [2019-03-28 12:38:45,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.91 [2019-03-28 12:38:45,939 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:45,940 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.91 [2019-03-28 12:38:45,940 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:45,951 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:45,968 INFO L340 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size 362.23/278.91 [2019-03-28 12:38:45,968 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 362.23/278.91 [2019-03-28 12:38:45,969 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:45,978 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:45,978 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:45,979 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:23 362.23/278.91 [2019-03-28 12:38:46,011 INFO L388 ElimStorePlain]: Different consts {1=[|v_#length_53|], 3=[|v_#valid_62|]} 362.23/278.91 [2019-03-28 12:38:46,015 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:46,016 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 362.23/278.91 [2019-03-28 12:38:46,016 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:46,027 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:46,038 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:46,039 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 362.23/278.91 [2019-03-28 12:38:46,039 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:46,048 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:46,049 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:46,049 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 362.23/278.91 [2019-03-28 12:38:46,091 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:38:46,091 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:46,102 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:46,105 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:38:46,105 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:46,115 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:46,115 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:46,115 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 362.23/278.91 [2019-03-28 12:38:46,149 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 362.23/278.91 [2019-03-28 12:38:46,149 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:46,157 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:46,160 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 362.23/278.91 [2019-03-28 12:38:46,160 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:46,166 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:46,167 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:46,167 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 362.23/278.91 [2019-03-28 12:38:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:46,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:38:46,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 32 362.23/278.91 [2019-03-28 12:38:46,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states 362.23/278.91 [2019-03-28 12:38:46,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. 362.23/278.91 [2019-03-28 12:38:46,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=870, Unknown=0, NotChecked=0, Total=1056 362.23/278.91 [2019-03-28 12:38:46,513 INFO L87 Difference]: Start difference. First operand 249 states and 306 transitions. Second operand 33 states. 362.23/278.91 [2019-03-28 12:38:52,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:38:52,585 INFO L93 Difference]: Finished difference Result 544 states and 658 transitions. 362.23/278.91 [2019-03-28 12:38:52,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. 362.23/278.91 [2019-03-28 12:38:52,585 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 28 362.23/278.91 [2019-03-28 12:38:52,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:38:52,588 INFO L225 Difference]: With dead ends: 544 362.23/278.91 [2019-03-28 12:38:52,588 INFO L226 Difference]: Without dead ends: 543 362.23/278.91 [2019-03-28 12:38:52,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2166 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1432, Invalid=6224, Unknown=0, NotChecked=0, Total=7656 362.23/278.91 [2019-03-28 12:38:52,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. 362.23/278.91 [2019-03-28 12:38:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 257. 362.23/278.91 [2019-03-28 12:38:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. 362.23/278.91 [2019-03-28 12:38:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 329 transitions. 362.23/278.91 [2019-03-28 12:38:52,638 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 329 transitions. Word has length 28 362.23/278.91 [2019-03-28 12:38:52,638 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:38:52,638 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 329 transitions. 362.23/278.91 [2019-03-28 12:38:52,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. 362.23/278.91 [2019-03-28 12:38:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 329 transitions. 362.23/278.91 [2019-03-28 12:38:52,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 362.23/278.91 [2019-03-28 12:38:52,639 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:38:52,639 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:38:52,639 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:38:52,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:38:52,640 INFO L82 PathProgramCache]: Analyzing trace with hash 226205330, now seen corresponding path program 1 times 362.23/278.91 [2019-03-28 12:38:52,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:38:52,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:38:52,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:52,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:52,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:53,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.91 [2019-03-28 12:38:53,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.91 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.91 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.91 [2019-03-28 12:38:53,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:53,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 53 conjunts are in the unsatisfiable core 362.23/278.91 [2019-03-28 12:38:53,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.91 [2019-03-28 12:38:53,144 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:53,145 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.91 [2019-03-28 12:38:53,145 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:53,157 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:53,157 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:53,157 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:15 362.23/278.91 [2019-03-28 12:38:53,188 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 362.23/278.91 [2019-03-28 12:38:53,188 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:53,193 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:53,193 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:53,193 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 362.23/278.91 [2019-03-28 12:38:53,223 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:53,224 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 362.23/278.91 [2019-03-28 12:38:53,225 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:53,232 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:53,232 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:53,232 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 362.23/278.91 [2019-03-28 12:38:53,266 INFO L388 ElimStorePlain]: Different consts {0=[|v_#memory_$Pointer$.base_36|], 2=[|v_#memory_int_35|]} 362.23/278.91 [2019-03-28 12:38:53,269 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:38:53,269 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:53,282 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:53,285 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:53,285 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 362.23/278.91 [2019-03-28 12:38:53,286 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:53,295 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:53,295 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:53,295 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 362.23/278.91 [2019-03-28 12:38:53,333 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 362.23/278.91 [2019-03-28 12:38:53,333 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:53,341 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:53,341 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:53,341 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:26 362.23/278.91 [2019-03-28 12:38:53,376 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:53,377 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 362.23/278.91 [2019-03-28 12:38:53,378 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:53,385 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:53,386 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:53,386 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:26 362.23/278.91 [2019-03-28 12:38:53,463 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:53,464 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 362.23/278.91 [2019-03-28 12:38:53,464 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:53,476 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:53,476 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:53,476 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:40, output treesize:26 362.23/278.91 [2019-03-28 12:38:53,521 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:53,522 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 362.23/278.91 [2019-03-28 12:38:53,523 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:53,536 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:53,536 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:53,537 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:23 362.23/278.91 [2019-03-28 12:38:53,624 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:53,624 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 362.23/278.91 [2019-03-28 12:38:53,625 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 362.23/278.91 [2019-03-28 12:38:53,637 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:53,638 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:53,638 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 362.23/278.91 [2019-03-28 12:38:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:53,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:38:53,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 30 362.23/278.91 [2019-03-28 12:38:53,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states 362.23/278.91 [2019-03-28 12:38:53,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. 362.23/278.91 [2019-03-28 12:38:53,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 362.23/278.91 [2019-03-28 12:38:53,845 INFO L87 Difference]: Start difference. First operand 257 states and 329 transitions. Second operand 31 states. 362.23/278.91 [2019-03-28 12:38:55,027 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 362.23/278.91 [2019-03-28 12:38:55,183 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 362.23/278.91 [2019-03-28 12:38:55,359 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 362.23/278.91 [2019-03-28 12:38:55,553 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 362.23/278.91 [2019-03-28 12:38:56,062 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 57 362.23/278.91 [2019-03-28 12:38:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:38:56,800 INFO L93 Difference]: Finished difference Result 419 states and 521 transitions. 362.23/278.91 [2019-03-28 12:38:56,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 362.23/278.91 [2019-03-28 12:38:56,801 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 362.23/278.91 [2019-03-28 12:38:56,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:38:56,803 INFO L225 Difference]: With dead ends: 419 362.23/278.91 [2019-03-28 12:38:56,803 INFO L226 Difference]: Without dead ends: 418 362.23/278.91 [2019-03-28 12:38:56,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=561, Invalid=2979, Unknown=0, NotChecked=0, Total=3540 362.23/278.91 [2019-03-28 12:38:56,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. 362.23/278.91 [2019-03-28 12:38:56,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 265. 362.23/278.91 [2019-03-28 12:38:56,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. 362.23/278.91 [2019-03-28 12:38:56,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 339 transitions. 362.23/278.91 [2019-03-28 12:38:56,855 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 339 transitions. Word has length 31 362.23/278.91 [2019-03-28 12:38:56,855 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:38:56,855 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 339 transitions. 362.23/278.91 [2019-03-28 12:38:56,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. 362.23/278.91 [2019-03-28 12:38:56,855 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 339 transitions. 362.23/278.91 [2019-03-28 12:38:56,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 362.23/278.91 [2019-03-28 12:38:56,856 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:38:56,856 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:38:56,856 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:38:56,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:38:56,857 INFO L82 PathProgramCache]: Analyzing trace with hash 257225137, now seen corresponding path program 1 times 362.23/278.91 [2019-03-28 12:38:56,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:38:56,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:38:56,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:56,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:56,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:57,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.91 [2019-03-28 12:38:57,191 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.91 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.91 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.91 [2019-03-28 12:38:57,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:38:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:38:57,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 52 conjunts are in the unsatisfiable core 362.23/278.91 [2019-03-28 12:38:57,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.91 [2019-03-28 12:38:57,250 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:57,250 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.91 [2019-03-28 12:38:57,251 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,259 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:57,260 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,260 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:15 362.23/278.91 [2019-03-28 12:38:57,290 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 362.23/278.91 [2019-03-28 12:38:57,290 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,297 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:57,297 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,297 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 362.23/278.91 [2019-03-28 12:38:57,330 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:57,331 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 362.23/278.91 [2019-03-28 12:38:57,332 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,341 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:57,347 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:57,348 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 362.23/278.91 [2019-03-28 12:38:57,348 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,356 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:57,356 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,356 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 362.23/278.91 [2019-03-28 12:38:57,390 INFO L388 ElimStorePlain]: Different consts {0=[|v_#memory_$Pointer$.base_37|], 2=[|v_#memory_int_40|]} 362.23/278.91 [2019-03-28 12:38:57,394 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:38:57,394 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,407 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:57,410 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 362.23/278.91 [2019-03-28 12:38:57,410 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,420 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:57,420 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,421 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 362.23/278.91 [2019-03-28 12:38:57,460 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 362.23/278.91 [2019-03-28 12:38:57,461 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,468 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:57,469 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,469 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:27 362.23/278.91 [2019-03-28 12:38:57,509 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 362.23/278.91 [2019-03-28 12:38:57,509 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,517 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:57,517 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,518 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:27 362.23/278.91 [2019-03-28 12:38:57,603 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:57,604 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 362.23/278.91 [2019-03-28 12:38:57,619 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,630 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:57,631 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,631 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:27 362.23/278.91 [2019-03-28 12:38:57,678 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:38:57,679 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 362.23/278.91 [2019-03-28 12:38:57,680 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,689 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:57,690 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,690 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:24 362.23/278.91 [2019-03-28 12:38:57,781 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:57,781 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 362.23/278.91 [2019-03-28 12:38:57,782 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,793 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:38:57,795 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:38:57,795 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 362.23/278.91 [2019-03-28 12:38:57,979 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:38:58,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:38:58,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 30 362.23/278.91 [2019-03-28 12:38:58,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states 362.23/278.91 [2019-03-28 12:38:58,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. 362.23/278.91 [2019-03-28 12:38:58,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 362.23/278.91 [2019-03-28 12:38:58,007 INFO L87 Difference]: Start difference. First operand 265 states and 339 transitions. Second operand 31 states. 362.23/278.91 [2019-03-28 12:38:58,853 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 362.23/278.91 [2019-03-28 12:38:59,305 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 362.23/278.91 [2019-03-28 12:38:59,599 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 66 362.23/278.91 [2019-03-28 12:39:00,358 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 362.23/278.91 [2019-03-28 12:39:00,508 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 362.23/278.91 [2019-03-28 12:39:00,829 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 362.23/278.91 [2019-03-28 12:39:01,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:39:01,156 INFO L93 Difference]: Finished difference Result 485 states and 587 transitions. 362.23/278.91 [2019-03-28 12:39:01,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 362.23/278.91 [2019-03-28 12:39:01,157 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 362.23/278.91 [2019-03-28 12:39:01,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:39:01,159 INFO L225 Difference]: With dead ends: 485 362.23/278.91 [2019-03-28 12:39:01,159 INFO L226 Difference]: Without dead ends: 445 362.23/278.91 [2019-03-28 12:39:01,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=509, Invalid=2571, Unknown=0, NotChecked=0, Total=3080 362.23/278.91 [2019-03-28 12:39:01,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. 362.23/278.91 [2019-03-28 12:39:01,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 144. 362.23/278.91 [2019-03-28 12:39:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. 362.23/278.91 [2019-03-28 12:39:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 181 transitions. 362.23/278.91 [2019-03-28 12:39:01,192 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 181 transitions. Word has length 31 362.23/278.91 [2019-03-28 12:39:01,192 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:39:01,192 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 181 transitions. 362.23/278.91 [2019-03-28 12:39:01,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. 362.23/278.91 [2019-03-28 12:39:01,193 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. 362.23/278.91 [2019-03-28 12:39:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 362.23/278.91 [2019-03-28 12:39:01,193 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:39:01,193 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:39:01,193 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:39:01,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:39:01,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1337689228, now seen corresponding path program 3 times 362.23/278.91 [2019-03-28 12:39:01,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:39:01,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:39:01,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:39:01,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:39:01,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:39:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:39:01,580 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:39:01,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.91 [2019-03-28 12:39:01,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.91 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.91 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.91 [2019-03-28 12:39:01,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 362.23/278.91 [2019-03-28 12:39:01,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) 362.23/278.91 [2019-03-28 12:39:01,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:39:01,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 48 conjunts are in the unsatisfiable core 362.23/278.91 [2019-03-28 12:39:01,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.91 [2019-03-28 12:39:01,672 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:39:01,673 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.91 [2019-03-28 12:39:01,673 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:01,683 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:01,687 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:39:01,688 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.91 [2019-03-28 12:39:01,688 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:01,700 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:01,700 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:01,701 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:25 362.23/278.91 [2019-03-28 12:39:01,736 INFO L388 ElimStorePlain]: Different consts {1=[|v_#length_59|], 3=[|v_#valid_65|]} 362.23/278.91 [2019-03-28 12:39:01,740 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:39:01,741 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 362.23/278.91 [2019-03-28 12:39:01,741 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:01,756 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:01,761 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:39:01,762 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:39:01,765 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:01,765 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 362.23/278.91 [2019-03-28 12:39:01,766 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:01,777 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:01,777 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:01,777 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 362.23/278.91 [2019-03-28 12:39:01,815 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:39:01,815 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:01,831 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:01,835 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:39:01,835 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:01,849 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:01,849 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:01,850 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:40 362.23/278.91 [2019-03-28 12:39:01,888 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 362.23/278.91 [2019-03-28 12:39:01,889 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:01,900 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:01,902 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 362.23/278.91 [2019-03-28 12:39:01,903 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:01,912 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:01,912 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:01,912 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:24 362.23/278.91 [2019-03-28 12:39:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:39:02,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:39:02,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 29 362.23/278.91 [2019-03-28 12:39:02,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states 362.23/278.91 [2019-03-28 12:39:02,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. 362.23/278.91 [2019-03-28 12:39:02,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 362.23/278.91 [2019-03-28 12:39:02,275 INFO L87 Difference]: Start difference. First operand 144 states and 181 transitions. Second operand 30 states. 362.23/278.91 [2019-03-28 12:39:02,870 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 362.23/278.91 [2019-03-28 12:39:03,082 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 362.23/278.91 [2019-03-28 12:39:04,092 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 362.23/278.91 [2019-03-28 12:39:07,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:39:07,302 INFO L93 Difference]: Finished difference Result 259 states and 320 transitions. 362.23/278.91 [2019-03-28 12:39:07,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. 362.23/278.91 [2019-03-28 12:39:07,302 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 32 362.23/278.91 [2019-03-28 12:39:07,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:39:07,303 INFO L225 Difference]: With dead ends: 259 362.23/278.91 [2019-03-28 12:39:07,304 INFO L226 Difference]: Without dead ends: 258 362.23/278.91 [2019-03-28 12:39:07,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1714 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=892, Invalid=5270, Unknown=0, NotChecked=0, Total=6162 362.23/278.91 [2019-03-28 12:39:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. 362.23/278.91 [2019-03-28 12:39:07,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 184. 362.23/278.91 [2019-03-28 12:39:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. 362.23/278.91 [2019-03-28 12:39:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 229 transitions. 362.23/278.91 [2019-03-28 12:39:07,344 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 229 transitions. Word has length 32 362.23/278.91 [2019-03-28 12:39:07,344 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:39:07,344 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 229 transitions. 362.23/278.91 [2019-03-28 12:39:07,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. 362.23/278.91 [2019-03-28 12:39:07,344 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 229 transitions. 362.23/278.91 [2019-03-28 12:39:07,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 362.23/278.91 [2019-03-28 12:39:07,345 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:39:07,345 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:39:07,345 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:39:07,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:39:07,346 INFO L82 PathProgramCache]: Analyzing trace with hash 387547245, now seen corresponding path program 1 times 362.23/278.91 [2019-03-28 12:39:07,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:39:07,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:39:07,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:39:07,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:39:07,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:39:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:39:07,738 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:39:07,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.91 [2019-03-28 12:39:07,738 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.91 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.91 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.91 [2019-03-28 12:39:07,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:39:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:39:07,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 55 conjunts are in the unsatisfiable core 362.23/278.91 [2019-03-28 12:39:07,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.91 [2019-03-28 12:39:07,797 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:39:07,798 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.91 [2019-03-28 12:39:07,798 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:07,809 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:07,812 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:39:07,812 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.91 [2019-03-28 12:39:07,813 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:07,823 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:07,823 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:07,823 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:25 362.23/278.91 [2019-03-28 12:39:07,857 INFO L388 ElimStorePlain]: Different consts {1=[|v_#length_61|], 3=[|v_#valid_67|]} 362.23/278.91 [2019-03-28 12:39:07,860 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:39:07,861 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 362.23/278.91 [2019-03-28 12:39:07,861 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:07,875 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:07,878 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:39:07,880 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:39:07,883 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:07,884 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 362.23/278.91 [2019-03-28 12:39:07,884 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:07,894 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:07,895 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:07,895 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 362.23/278.91 [2019-03-28 12:39:07,931 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:39:07,931 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:07,945 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:07,948 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:39:07,949 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:07,961 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:07,962 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:07,962 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:40 362.23/278.91 [2019-03-28 12:39:08,002 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 362.23/278.91 [2019-03-28 12:39:08,003 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:08,014 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:08,017 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 362.23/278.91 [2019-03-28 12:39:08,017 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:08,026 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:08,026 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:08,026 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:24 362.23/278.91 [2019-03-28 12:39:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:39:08,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:39:08,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 33 362.23/278.91 [2019-03-28 12:39:08,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states 362.23/278.91 [2019-03-28 12:39:08,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. 362.23/278.91 [2019-03-28 12:39:08,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 362.23/278.91 [2019-03-28 12:39:08,476 INFO L87 Difference]: Start difference. First operand 184 states and 229 transitions. Second operand 34 states. 362.23/278.91 [2019-03-28 12:39:09,704 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 362.23/278.91 [2019-03-28 12:39:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.91 [2019-03-28 12:39:17,260 INFO L93 Difference]: Finished difference Result 338 states and 413 transitions. 362.23/278.91 [2019-03-28 12:39:17,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. 362.23/278.91 [2019-03-28 12:39:17,260 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 38 362.23/278.91 [2019-03-28 12:39:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.91 [2019-03-28 12:39:17,262 INFO L225 Difference]: With dead ends: 338 362.23/278.91 [2019-03-28 12:39:17,262 INFO L226 Difference]: Without dead ends: 337 362.23/278.91 [2019-03-28 12:39:17,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4922 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2049, Invalid=12471, Unknown=0, NotChecked=0, Total=14520 362.23/278.91 [2019-03-28 12:39:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. 362.23/278.91 [2019-03-28 12:39:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 202. 362.23/278.91 [2019-03-28 12:39:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. 362.23/278.91 [2019-03-28 12:39:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 252 transitions. 362.23/278.91 [2019-03-28 12:39:17,307 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 252 transitions. Word has length 38 362.23/278.91 [2019-03-28 12:39:17,307 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.91 [2019-03-28 12:39:17,307 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 252 transitions. 362.23/278.91 [2019-03-28 12:39:17,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. 362.23/278.91 [2019-03-28 12:39:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 252 transitions. 362.23/278.91 [2019-03-28 12:39:17,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 362.23/278.91 [2019-03-28 12:39:17,308 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.91 [2019-03-28 12:39:17,308 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.91 [2019-03-28 12:39:17,309 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.91 [2019-03-28 12:39:17,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.91 [2019-03-28 12:39:17,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1653069067, now seen corresponding path program 2 times 362.23/278.91 [2019-03-28 12:39:17,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.91 [2019-03-28 12:39:17,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.91 [2019-03-28 12:39:17,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:39:17,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:39:17,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.91 [2019-03-28 12:39:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:39:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 65 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:39:18,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.91 [2019-03-28 12:39:18,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.91 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.91 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.91 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.91 [2019-03-28 12:39:18,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 362.23/278.91 [2019-03-28 12:39:18,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 362.23/278.91 [2019-03-28 12:39:18,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 362.23/278.91 [2019-03-28 12:39:18,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 90 conjunts are in the unsatisfiable core 362.23/278.91 [2019-03-28 12:39:18,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.91 [2019-03-28 12:39:18,233 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:39:18,234 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.91 [2019-03-28 12:39:18,234 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:18,246 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:18,249 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:39:18,250 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.91 [2019-03-28 12:39:18,250 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:18,262 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:18,263 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:18,263 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:25 362.23/278.91 [2019-03-28 12:39:18,311 INFO L388 ElimStorePlain]: Different consts {1=[|v_#length_63|], 3=[|v_#valid_69|]} 362.23/278.91 [2019-03-28 12:39:18,316 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:39:18,317 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 362.23/278.91 [2019-03-28 12:39:18,317 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:18,332 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:18,337 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:39:18,338 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.91 [2019-03-28 12:39:18,342 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:18,343 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 362.23/278.91 [2019-03-28 12:39:18,343 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:18,355 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:18,355 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:18,356 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 362.23/278.91 [2019-03-28 12:39:18,408 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:39:18,408 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:18,424 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:18,428 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.91 [2019-03-28 12:39:18,428 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:18,443 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:18,443 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:18,443 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:40 362.23/278.91 [2019-03-28 12:39:18,499 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 362.23/278.91 [2019-03-28 12:39:18,499 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:18,512 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:18,515 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 362.23/278.91 [2019-03-28 12:39:18,515 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:18,525 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.91 [2019-03-28 12:39:18,526 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.91 [2019-03-28 12:39:18,526 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:24 362.23/278.91 [2019-03-28 12:39:19,747 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.91 [2019-03-28 12:39:19,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.91 [2019-03-28 12:39:19,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24] total 53 362.23/278.91 [2019-03-28 12:39:19,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states 362.23/278.91 [2019-03-28 12:39:19,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. 362.23/278.91 [2019-03-28 12:39:19,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=2371, Unknown=0, NotChecked=0, Total=2862 362.23/278.91 [2019-03-28 12:39:19,776 INFO L87 Difference]: Start difference. First operand 202 states and 252 transitions. Second operand 54 states. 362.23/278.91 [2019-03-28 12:39:20,388 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 362.23/278.91 [2019-03-28 12:39:20,627 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 362.23/278.91 [2019-03-28 12:39:22,234 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 362.23/278.91 [2019-03-28 12:39:24,786 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 362.23/278.91 [2019-03-28 12:39:27,459 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 362.23/278.91 [2019-03-28 12:39:30,222 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 362.23/278.91 [2019-03-28 12:39:33,044 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 362.23/278.91 [2019-03-28 12:39:35,039 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 362.23/278.91 [2019-03-28 12:39:36,535 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 362.23/278.91 [2019-03-28 12:39:37,959 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 362.23/278.91 [2019-03-28 12:39:38,968 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 362.23/278.92 [2019-03-28 12:39:39,710 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 362.23/278.92 [2019-03-28 12:39:40,722 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 362.23/278.92 [2019-03-28 12:39:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.92 [2019-03-28 12:39:40,746 INFO L93 Difference]: Finished difference Result 398 states and 477 transitions. 362.23/278.92 [2019-03-28 12:39:40,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. 362.23/278.92 [2019-03-28 12:39:40,746 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 43 362.23/278.92 [2019-03-28 12:39:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.92 [2019-03-28 12:39:40,748 INFO L225 Difference]: With dead ends: 398 362.23/278.92 [2019-03-28 12:39:40,748 INFO L226 Difference]: Without dead ends: 249 362.23/278.92 [2019-03-28 12:39:40,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13792 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=6332, Invalid=35488, Unknown=0, NotChecked=0, Total=41820 362.23/278.92 [2019-03-28 12:39:40,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. 362.23/278.92 [2019-03-28 12:39:40,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 195. 362.23/278.92 [2019-03-28 12:39:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. 362.23/278.92 [2019-03-28 12:39:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. 362.23/278.92 [2019-03-28 12:39:40,790 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 43 362.23/278.92 [2019-03-28 12:39:40,790 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.92 [2019-03-28 12:39:40,790 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. 362.23/278.92 [2019-03-28 12:39:40,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. 362.23/278.92 [2019-03-28 12:39:40,791 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. 362.23/278.92 [2019-03-28 12:39:40,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 362.23/278.92 [2019-03-28 12:39:40,791 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.92 [2019-03-28 12:39:40,791 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.92 [2019-03-28 12:39:40,792 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.92 [2019-03-28 12:39:40,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.92 [2019-03-28 12:39:40,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1435832538, now seen corresponding path program 4 times 362.23/278.92 [2019-03-28 12:39:40,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.92 [2019-03-28 12:39:40,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.92 [2019-03-28 12:39:40,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.92 [2019-03-28 12:39:40,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 362.23/278.92 [2019-03-28 12:39:40,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.92 [2019-03-28 12:39:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.92 [2019-03-28 12:39:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.92 [2019-03-28 12:39:41,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.92 [2019-03-28 12:39:41,270 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.92 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.92 Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.92 [2019-03-28 12:39:41,281 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST 362.23/278.92 [2019-03-28 12:39:41,323 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) 362.23/278.92 [2019-03-28 12:39:41,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 362.23/278.92 [2019-03-28 12:39:41,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 76 conjunts are in the unsatisfiable core 362.23/278.92 [2019-03-28 12:39:41,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.92 [2019-03-28 12:39:41,333 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.92 [2019-03-28 12:39:41,334 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.92 [2019-03-28 12:39:41,334 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:41,344 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:41,347 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.92 [2019-03-28 12:39:41,348 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.92 [2019-03-28 12:39:41,348 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:41,359 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:41,359 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:41,360 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:25 362.23/278.92 [2019-03-28 12:39:41,391 INFO L388 ElimStorePlain]: Different consts {1=[|v_#length_65|], 3=[|v_#valid_71|]} 362.23/278.92 [2019-03-28 12:39:41,394 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.92 [2019-03-28 12:39:41,395 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 362.23/278.92 [2019-03-28 12:39:41,396 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:41,409 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:41,413 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.92 [2019-03-28 12:39:41,413 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.92 [2019-03-28 12:39:41,418 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:41,418 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 362.23/278.92 [2019-03-28 12:39:41,418 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:41,429 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:41,429 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:41,429 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:27 362.23/278.92 [2019-03-28 12:39:41,468 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.92 [2019-03-28 12:39:41,468 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:41,484 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:41,487 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.92 [2019-03-28 12:39:41,487 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:41,502 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:41,503 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:41,503 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:43 362.23/278.92 [2019-03-28 12:39:41,545 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 362.23/278.92 [2019-03-28 12:39:41,546 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:41,578 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:41,580 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 362.23/278.92 [2019-03-28 12:39:41,581 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:41,591 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:41,592 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:41,592 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:27 362.23/278.92 [2019-03-28 12:39:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.92 [2019-03-28 12:39:42,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.92 [2019-03-28 12:39:42,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 37 362.23/278.92 [2019-03-28 12:39:42,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states 362.23/278.92 [2019-03-28 12:39:42,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. 362.23/278.92 [2019-03-28 12:39:42,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1190, Unknown=0, NotChecked=0, Total=1406 362.23/278.92 [2019-03-28 12:39:42,154 INFO L87 Difference]: Start difference. First operand 195 states and 231 transitions. Second operand 38 states. 362.23/278.92 [2019-03-28 12:39:42,762 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 362.23/278.92 [2019-03-28 12:39:43,001 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 362.23/278.92 [2019-03-28 12:39:43,668 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 362.23/278.92 [2019-03-28 12:39:48,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.92 [2019-03-28 12:39:48,973 INFO L93 Difference]: Finished difference Result 233 states and 278 transitions. 362.23/278.92 [2019-03-28 12:39:48,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. 362.23/278.92 [2019-03-28 12:39:48,973 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 44 362.23/278.92 [2019-03-28 12:39:48,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.92 [2019-03-28 12:39:48,975 INFO L225 Difference]: With dead ends: 233 362.23/278.92 [2019-03-28 12:39:48,975 INFO L226 Difference]: Without dead ends: 232 362.23/278.92 [2019-03-28 12:39:48,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3391 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1542, Invalid=9170, Unknown=0, NotChecked=0, Total=10712 362.23/278.92 [2019-03-28 12:39:48,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. 362.23/278.92 [2019-03-28 12:39:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 219. 362.23/278.92 [2019-03-28 12:39:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. 362.23/278.92 [2019-03-28 12:39:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 257 transitions. 362.23/278.92 [2019-03-28 12:39:49,021 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 257 transitions. Word has length 44 362.23/278.92 [2019-03-28 12:39:49,021 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.92 [2019-03-28 12:39:49,021 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 257 transitions. 362.23/278.92 [2019-03-28 12:39:49,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. 362.23/278.92 [2019-03-28 12:39:49,021 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 257 transitions. 362.23/278.92 [2019-03-28 12:39:49,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 362.23/278.92 [2019-03-28 12:39:49,022 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.92 [2019-03-28 12:39:49,022 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.92 [2019-03-28 12:39:49,022 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.92 [2019-03-28 12:39:49,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.92 [2019-03-28 12:39:49,023 INFO L82 PathProgramCache]: Analyzing trace with hash 502008096, now seen corresponding path program 1 times 362.23/278.92 [2019-03-28 12:39:49,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.92 [2019-03-28 12:39:49,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.92 [2019-03-28 12:39:49,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.92 [2019-03-28 12:39:49,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 362.23/278.92 [2019-03-28 12:39:49,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.92 [2019-03-28 12:39:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.92 [2019-03-28 12:39:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. 362.23/278.92 [2019-03-28 12:39:49,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.92 [2019-03-28 12:39:49,181 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.92 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.92 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.92 [2019-03-28 12:39:49,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.92 [2019-03-28 12:39:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.92 [2019-03-28 12:39:49,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 80 conjunts are in the unsatisfiable core 362.23/278.92 [2019-03-28 12:39:49,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.92 [2019-03-28 12:39:49,248 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.92 [2019-03-28 12:39:49,248 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.92 [2019-03-28 12:39:49,249 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:49,256 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:49,256 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:49,257 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 362.23/278.92 [2019-03-28 12:39:49,280 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.92 [2019-03-28 12:39:49,281 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 362.23/278.92 [2019-03-28 12:39:49,281 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:49,291 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:49,291 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:49,291 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 362.23/278.92 [2019-03-28 12:39:49,322 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.92 [2019-03-28 12:39:49,322 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:49,336 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:49,339 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.92 [2019-03-28 12:39:49,339 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:49,352 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:49,352 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:49,352 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:35 362.23/278.92 [2019-03-28 12:39:49,385 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 362.23/278.92 [2019-03-28 12:39:49,385 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:49,397 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:49,400 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 362.23/278.92 [2019-03-28 12:39:49,400 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:49,409 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:49,409 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:49,410 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:23 362.23/278.92 [2019-03-28 12:39:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.92 [2019-03-28 12:39:49,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.92 [2019-03-28 12:39:49,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 30 362.23/278.92 [2019-03-28 12:39:49,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states 362.23/278.92 [2019-03-28 12:39:49,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. 362.23/278.92 [2019-03-28 12:39:49,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 362.23/278.92 [2019-03-28 12:39:49,998 INFO L87 Difference]: Start difference. First operand 219 states and 257 transitions. Second operand 31 states. 362.23/278.92 [2019-03-28 12:39:54,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.92 [2019-03-28 12:39:54,232 INFO L93 Difference]: Finished difference Result 271 states and 318 transitions. 362.23/278.92 [2019-03-28 12:39:54,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. 362.23/278.92 [2019-03-28 12:39:54,232 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 50 362.23/278.92 [2019-03-28 12:39:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.92 [2019-03-28 12:39:54,233 INFO L225 Difference]: With dead ends: 271 362.23/278.92 [2019-03-28 12:39:54,233 INFO L226 Difference]: Without dead ends: 175 362.23/278.92 [2019-03-28 12:39:54,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1524 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=825, Invalid=5027, Unknown=0, NotChecked=0, Total=5852 362.23/278.92 [2019-03-28 12:39:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. 362.23/278.92 [2019-03-28 12:39:54,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. 362.23/278.92 [2019-03-28 12:39:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. 362.23/278.92 [2019-03-28 12:39:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 204 transitions. 362.23/278.92 [2019-03-28 12:39:54,269 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 204 transitions. Word has length 50 362.23/278.92 [2019-03-28 12:39:54,270 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.92 [2019-03-28 12:39:54,270 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 204 transitions. 362.23/278.92 [2019-03-28 12:39:54,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. 362.23/278.92 [2019-03-28 12:39:54,270 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 204 transitions. 362.23/278.92 [2019-03-28 12:39:54,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 362.23/278.92 [2019-03-28 12:39:54,271 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.92 [2019-03-28 12:39:54,271 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.92 [2019-03-28 12:39:54,271 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.92 [2019-03-28 12:39:54,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.92 [2019-03-28 12:39:54,271 INFO L82 PathProgramCache]: Analyzing trace with hash -121279264, now seen corresponding path program 1 times 362.23/278.92 [2019-03-28 12:39:54,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.92 [2019-03-28 12:39:54,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.92 [2019-03-28 12:39:54,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.92 [2019-03-28 12:39:54,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.92 [2019-03-28 12:39:54,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.92 [2019-03-28 12:39:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.92 [2019-03-28 12:39:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.92 [2019-03-28 12:39:54,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.92 [2019-03-28 12:39:54,788 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.92 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.92 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.92 [2019-03-28 12:39:54,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.92 [2019-03-28 12:39:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.92 [2019-03-28 12:39:54,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 70 conjunts are in the unsatisfiable core 362.23/278.92 [2019-03-28 12:39:54,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.92 [2019-03-28 12:39:54,857 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.92 [2019-03-28 12:39:54,858 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.92 [2019-03-28 12:39:54,858 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:54,866 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:54,877 INFO L340 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size 362.23/278.92 [2019-03-28 12:39:54,878 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 362.23/278.92 [2019-03-28 12:39:54,878 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:54,886 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:54,887 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:54,887 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:23 362.23/278.92 [2019-03-28 12:39:54,920 INFO L388 ElimStorePlain]: Different consts {1=[|v_#length_69|], 3=[|v_#valid_73|]} 362.23/278.92 [2019-03-28 12:39:54,923 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.92 [2019-03-28 12:39:54,924 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 362.23/278.92 [2019-03-28 12:39:54,924 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:54,935 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:54,946 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:54,946 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 362.23/278.92 [2019-03-28 12:39:54,946 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:54,955 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:54,956 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:54,956 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 362.23/278.92 [2019-03-28 12:39:54,988 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.92 [2019-03-28 12:39:54,988 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:54,999 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:55,002 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.92 [2019-03-28 12:39:55,002 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:55,012 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:55,012 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:55,013 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 362.23/278.92 [2019-03-28 12:39:55,048 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 362.23/278.92 [2019-03-28 12:39:55,049 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:55,057 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:55,059 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 362.23/278.92 [2019-03-28 12:39:55,059 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:55,065 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:39:55,065 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.92 [2019-03-28 12:39:55,066 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 362.23/278.92 [2019-03-28 12:39:55,636 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.92 [2019-03-28 12:39:55,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.92 [2019-03-28 12:39:55,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 41 362.23/278.92 [2019-03-28 12:39:55,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states 362.23/278.92 [2019-03-28 12:39:55,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. 362.23/278.92 [2019-03-28 12:39:55,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1426, Unknown=0, NotChecked=0, Total=1722 362.23/278.92 [2019-03-28 12:39:55,665 INFO L87 Difference]: Start difference. First operand 175 states and 204 transitions. Second operand 42 states. 362.23/278.92 [2019-03-28 12:40:01,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.92 [2019-03-28 12:40:01,833 INFO L93 Difference]: Finished difference Result 224 states and 263 transitions. 362.23/278.92 [2019-03-28 12:40:01,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. 362.23/278.92 [2019-03-28 12:40:01,833 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 50 362.23/278.92 [2019-03-28 12:40:01,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.92 [2019-03-28 12:40:01,834 INFO L225 Difference]: With dead ends: 224 362.23/278.92 [2019-03-28 12:40:01,835 INFO L226 Difference]: Without dead ends: 223 362.23/278.92 [2019-03-28 12:40:01,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3057 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1791, Invalid=8309, Unknown=0, NotChecked=0, Total=10100 362.23/278.92 [2019-03-28 12:40:01,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. 362.23/278.92 [2019-03-28 12:40:01,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 159. 362.23/278.92 [2019-03-28 12:40:01,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. 362.23/278.92 [2019-03-28 12:40:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 189 transitions. 362.23/278.92 [2019-03-28 12:40:01,869 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 189 transitions. Word has length 50 362.23/278.92 [2019-03-28 12:40:01,870 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.92 [2019-03-28 12:40:01,870 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 189 transitions. 362.23/278.92 [2019-03-28 12:40:01,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. 362.23/278.92 [2019-03-28 12:40:01,870 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. 362.23/278.92 [2019-03-28 12:40:01,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 362.23/278.92 [2019-03-28 12:40:01,871 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.92 [2019-03-28 12:40:01,871 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.92 [2019-03-28 12:40:01,871 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.92 [2019-03-28 12:40:01,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.92 [2019-03-28 12:40:01,871 INFO L82 PathProgramCache]: Analyzing trace with hash 815678830, now seen corresponding path program 1 times 362.23/278.92 [2019-03-28 12:40:01,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.92 [2019-03-28 12:40:01,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.92 [2019-03-28 12:40:01,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.92 [2019-03-28 12:40:01,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.92 [2019-03-28 12:40:01,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.92 [2019-03-28 12:40:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.92 [2019-03-28 12:40:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 122 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.92 [2019-03-28 12:40:02,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.92 [2019-03-28 12:40:02,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.92 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.92 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.92 [2019-03-28 12:40:02,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.92 [2019-03-28 12:40:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.92 [2019-03-28 12:40:02,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 104 conjunts are in the unsatisfiable core 362.23/278.92 [2019-03-28 12:40:02,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.92 [2019-03-28 12:40:02,702 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.92 [2019-03-28 12:40:02,703 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.92 [2019-03-28 12:40:02,703 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:02,714 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:40:02,717 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.92 [2019-03-28 12:40:02,718 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.92 [2019-03-28 12:40:02,718 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:02,729 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:40:02,730 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:02,730 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:25 362.23/278.92 [2019-03-28 12:40:02,772 INFO L388 ElimStorePlain]: Different consts {1=[|v_#length_71|], 3=[|v_#valid_75|]} 362.23/278.92 [2019-03-28 12:40:02,776 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.92 [2019-03-28 12:40:02,776 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 362.23/278.92 [2019-03-28 12:40:02,777 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:02,792 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:40:02,795 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.92 [2019-03-28 12:40:02,796 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.92 [2019-03-28 12:40:02,801 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:40:02,802 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 362.23/278.92 [2019-03-28 12:40:02,802 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:02,814 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:40:02,815 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:02,815 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:27 362.23/278.92 [2019-03-28 12:40:02,866 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.92 [2019-03-28 12:40:02,866 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:02,883 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:40:02,887 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.92 [2019-03-28 12:40:02,888 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:02,906 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:40:02,906 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:02,906 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:43 362.23/278.92 [2019-03-28 12:40:02,962 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 362.23/278.92 [2019-03-28 12:40:02,963 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:02,977 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:40:02,980 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 362.23/278.92 [2019-03-28 12:40:02,980 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:02,992 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:40:02,993 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:02,993 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:27 362.23/278.92 [2019-03-28 12:40:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.92 [2019-03-28 12:40:04,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.92 [2019-03-28 12:40:04,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24] total 52 362.23/278.92 [2019-03-28 12:40:04,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states 362.23/278.92 [2019-03-28 12:40:04,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. 362.23/278.92 [2019-03-28 12:40:04,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=2315, Unknown=0, NotChecked=0, Total=2756 362.23/278.92 [2019-03-28 12:40:04,365 INFO L87 Difference]: Start difference. First operand 159 states and 189 transitions. Second operand 53 states. 362.23/278.92 [2019-03-28 12:40:05,076 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 362.23/278.92 [2019-03-28 12:40:05,381 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 362.23/278.92 [2019-03-28 12:40:05,780 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 362.23/278.92 [2019-03-28 12:40:06,062 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 362.23/278.92 [2019-03-28 12:40:06,740 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 362.23/278.92 [2019-03-28 12:40:07,502 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 362.23/278.92 [2019-03-28 12:40:08,253 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 362.23/278.92 [2019-03-28 12:40:09,001 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 362.23/278.92 [2019-03-28 12:40:09,774 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 362.23/278.92 [2019-03-28 12:40:10,555 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 362.23/278.92 [2019-03-28 12:40:11,361 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 362.23/278.92 [2019-03-28 12:40:12,165 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 362.23/278.92 [2019-03-28 12:40:12,801 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 362.23/278.92 [2019-03-28 12:40:13,282 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 362.23/278.92 [2019-03-28 12:40:13,732 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 362.23/278.92 [2019-03-28 12:40:13,987 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 362.23/278.92 [2019-03-28 12:40:14,579 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 362.23/278.92 [2019-03-28 12:40:15,017 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 362.23/278.92 [2019-03-28 12:40:15,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.92 [2019-03-28 12:40:15,018 INFO L93 Difference]: Finished difference Result 256 states and 304 transitions. 362.23/278.92 [2019-03-28 12:40:15,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. 362.23/278.92 [2019-03-28 12:40:15,018 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 67 362.23/278.92 [2019-03-28 12:40:15,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.92 [2019-03-28 12:40:15,020 INFO L225 Difference]: With dead ends: 256 362.23/278.92 [2019-03-28 12:40:15,020 INFO L226 Difference]: Without dead ends: 243 362.23/278.92 [2019-03-28 12:40:15,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5059 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=2863, Invalid=15227, Unknown=0, NotChecked=0, Total=18090 362.23/278.92 [2019-03-28 12:40:15,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. 362.23/278.92 [2019-03-28 12:40:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 95. 362.23/278.92 [2019-03-28 12:40:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. 362.23/278.92 [2019-03-28 12:40:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. 362.23/278.92 [2019-03-28 12:40:15,043 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 67 362.23/278.92 [2019-03-28 12:40:15,043 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.92 [2019-03-28 12:40:15,043 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. 362.23/278.92 [2019-03-28 12:40:15,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. 362.23/278.92 [2019-03-28 12:40:15,044 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. 362.23/278.92 [2019-03-28 12:40:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 362.23/278.92 [2019-03-28 12:40:15,044 INFO L394 BasicCegarLoop]: Found error trace 362.23/278.92 [2019-03-28 12:40:15,045 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.23/278.92 [2019-03-28 12:40:15,045 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 362.23/278.92 [2019-03-28 12:40:15,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.23/278.92 [2019-03-28 12:40:15,045 INFO L82 PathProgramCache]: Analyzing trace with hash 348516334, now seen corresponding path program 5 times 362.23/278.92 [2019-03-28 12:40:15,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.23/278.92 [2019-03-28 12:40:15,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.23/278.92 [2019-03-28 12:40:15,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.92 [2019-03-28 12:40:15,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.23/278.92 [2019-03-28 12:40:15,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.23/278.92 [2019-03-28 12:40:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.23/278.92 [2019-03-28 12:40:16,164 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 333 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.92 [2019-03-28 12:40:16,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.23/278.92 [2019-03-28 12:40:16,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.23/278.92 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.23/278.92 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.23/278.92 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.23/278.92 [2019-03-28 12:40:16,176 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 362.23/278.92 [2019-03-28 12:40:18,421 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) 362.23/278.92 [2019-03-28 12:40:18,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 362.23/278.92 [2019-03-28 12:40:18,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 118 conjunts are in the unsatisfiable core 362.23/278.92 [2019-03-28 12:40:18,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.23/278.92 [2019-03-28 12:40:18,455 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.92 [2019-03-28 12:40:18,456 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.92 [2019-03-28 12:40:18,456 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:18,478 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:40:18,481 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.92 [2019-03-28 12:40:18,482 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 362.23/278.92 [2019-03-28 12:40:18,482 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:18,493 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:40:18,493 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:18,494 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:25 362.23/278.92 [2019-03-28 12:40:18,547 INFO L388 ElimStorePlain]: Different consts {1=[|v_#length_73|], 3=[|v_#valid_77|]} 362.23/278.92 [2019-03-28 12:40:18,550 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.92 [2019-03-28 12:40:18,550 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 362.23/278.92 [2019-03-28 12:40:18,551 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:18,565 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:40:18,568 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.92 [2019-03-28 12:40:18,570 INFO L189 IndexEqualityManager]: detected not equals via solver 362.23/278.92 [2019-03-28 12:40:18,573 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:40:18,573 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 362.23/278.92 [2019-03-28 12:40:18,574 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:18,584 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:40:18,585 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:18,585 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 362.23/278.92 [2019-03-28 12:40:18,639 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.92 [2019-03-28 12:40:18,639 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:18,655 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:40:18,658 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 362.23/278.92 [2019-03-28 12:40:18,659 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:18,673 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:40:18,673 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:18,673 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:40 362.23/278.92 [2019-03-28 12:40:18,734 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 362.23/278.92 [2019-03-28 12:40:18,734 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:18,746 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:40:18,748 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 362.23/278.92 [2019-03-28 12:40:18,749 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:18,758 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.23/278.92 [2019-03-28 12:40:18,758 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.23/278.92 [2019-03-28 12:40:18,758 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:24 362.23/278.92 [2019-03-28 12:40:21,017 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.23/278.92 [2019-03-28 12:40:21,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.23/278.92 [2019-03-28 12:40:21,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 33] total 70 362.23/278.92 [2019-03-28 12:40:21,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states 362.23/278.92 [2019-03-28 12:40:21,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. 362.23/278.92 [2019-03-28 12:40:21,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=856, Invalid=4114, Unknown=0, NotChecked=0, Total=4970 362.23/278.92 [2019-03-28 12:40:21,049 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand 71 states. 362.23/278.92 [2019-03-28 12:40:21,722 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 362.23/278.92 [2019-03-28 12:40:21,980 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 362.23/278.92 [2019-03-28 12:40:22,679 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 362.23/278.92 [2019-03-28 12:40:23,541 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 362.23/278.92 [2019-03-28 12:40:24,627 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 362.23/278.92 [2019-03-28 12:40:25,743 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 362.23/278.92 [2019-03-28 12:40:26,878 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 362.23/278.92 [2019-03-28 12:40:28,043 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 362.23/278.92 [2019-03-28 12:40:29,235 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 362.23/278.92 [2019-03-28 12:40:30,439 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 362.23/278.92 [2019-03-28 12:40:31,674 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 362.23/278.92 [2019-03-28 12:40:32,936 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 362.23/278.92 [2019-03-28 12:40:34,219 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 362.23/278.92 [2019-03-28 12:40:35,526 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 362.23/278.92 [2019-03-28 12:40:36,844 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 362.23/278.92 [2019-03-28 12:40:39,083 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 362.23/278.92 [2019-03-28 12:40:39,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.23/278.92 [2019-03-28 12:40:39,085 INFO L93 Difference]: Finished difference Result 190 states and 224 transitions. 362.23/278.92 [2019-03-28 12:40:39,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. 362.23/278.92 [2019-03-28 12:40:39,085 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 92 362.23/278.92 [2019-03-28 12:40:39,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 362.23/278.92 [2019-03-28 12:40:39,086 INFO L225 Difference]: With dead ends: 190 362.23/278.92 [2019-03-28 12:40:39,086 INFO L226 Difference]: Without dead ends: 0 362.23/278.92 [2019-03-28 12:40:39,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11024 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=5937, Invalid=30735, Unknown=0, NotChecked=0, Total=36672 362.23/278.92 [2019-03-28 12:40:39,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 362.23/278.92 [2019-03-28 12:40:39,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 362.23/278.92 [2019-03-28 12:40:39,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 362.23/278.92 [2019-03-28 12:40:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 362.23/278.92 [2019-03-28 12:40:39,088 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 362.23/278.92 [2019-03-28 12:40:39,088 INFO L84 Accepts]: Finished accepts. word is rejected. 362.23/278.92 [2019-03-28 12:40:39,088 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 362.23/278.92 [2019-03-28 12:40:39,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. 362.23/278.92 [2019-03-28 12:40:39,089 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 362.23/278.92 [2019-03-28 12:40:39,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 362.23/278.92 [2019-03-28 12:40:39,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 362.23/278.92 [2019-03-28 12:40:39,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:39,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:40,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:40,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:41,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:41,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:41,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:41,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:41,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:43,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:43,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:44,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:44,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:44,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:44,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:44,132 WARN L188 SmtUtils]: Spent 5.03 s on a formula simplification. DAG size of input: 734 DAG size of output: 655 362.23/278.92 [2019-03-28 12:40:44,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:44,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:44,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:44,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:44,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:44,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:46,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 362.23/278.92 [2019-03-28 12:40:50,706 WARN L188 SmtUtils]: Spent 6.57 s on a formula simplification. DAG size of input: 1030 DAG size of output: 947 362.23/278.92 [2019-03-28 12:41:02,751 WARN L188 SmtUtils]: Spent 12.04 s on a formula simplification. DAG size of input: 644 DAG size of output: 114 362.23/278.92 [2019-03-28 12:41:53,901 WARN L188 SmtUtils]: Spent 51.14 s on a formula simplification. DAG size of input: 940 DAG size of output: 227 362.23/278.92 [2019-03-28 12:41:53,904 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,905 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,905 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,905 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,905 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,905 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,905 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 32 34) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,905 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,905 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,905 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,906 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,906 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,906 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(lines 5 24) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,906 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,906 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,906 INFO L448 ceAbstractionStarter]: For program point L8(lines 8 22) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,906 INFO L448 ceAbstractionStarter]: For program point L8-1(lines 8 22) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,906 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,906 INFO L448 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,907 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,907 INFO L448 ceAbstractionStarter]: For program point L29-2(lines 26 40) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,907 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,907 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 18) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,907 INFO L444 ceAbstractionStarter]: At program point L17-2(lines 15 18) the Hoare annotation is: (let ((.cse9 (= ULTIMATE.start_main_~length~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base)))) (let ((.cse5 (<= 1 |ULTIMATE.start_cstpncpy_#in~n|)) (.cse3 (<= 1 ULTIMATE.start_cstpncpy_~d~0.offset)) (.cse2 (and (<= 0 ULTIMATE.start_cstpncpy_~src.offset) .cse9 (<= 0 |ULTIMATE.start_cstpncpy_~#dst.offset|) (<= 0 |ULTIMATE.start_cstpncpy_#in~dst.offset|) (<= 1 ULTIMATE.start_main_~n~0) (<= 0 |ULTIMATE.start_cstpncpy_#in~src.offset|) (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1) (= ULTIMATE.start_main_~nondetString~0.offset 0) (= (select |#valid| |ULTIMATE.start_cstpncpy_~#dst.base|) 1) (= (select |#valid| ULTIMATE.start_cstpncpy_~s~0.base) 1) (= (select |#valid| ULTIMATE.start_cstpncpy_~src.base) 1) (= 8 (select |#length| |ULTIMATE.start_cstpncpy_~#dst.base|)) (<= (+ ULTIMATE.start_cstpncpy_~src.offset 1) (select |#length| ULTIMATE.start_cstpncpy_~src.base)) (= 1 (select |#valid| ULTIMATE.start_cstpncpy_~d~0.base)) (<= (+ |ULTIMATE.start_cstpncpy_#in~src.offset| 1) (select |#length| |ULTIMATE.start_cstpncpy_#in~src.base|)) (= 1 (select |#valid| |ULTIMATE.start_cstpncpy_#in~src.base|)) (<= 0 ULTIMATE.start_cstpncpy_~s~0.offset) (<= |ULTIMATE.start_cstpncpy_~#dst.offset| 0) (= (select |#valid| |ULTIMATE.start_cstpncpy_#in~dst.base|) 1) (= ULTIMATE.start_main_~nondetArea~0.offset ULTIMATE.start_main_~nondetString~0.offset) (= (select |#valid| ULTIMATE.start_main_~nondetString~0.base) 1) (<= 0 ULTIMATE.start_cstpncpy_~d~0.offset))) (.cse1 (= ULTIMATE.start_main_~n~0 (select |#length| ULTIMATE.start_main_~nondetArea~0.base))) (.cse4 (<= (+ |ULTIMATE.start_cstpncpy_#in~n| |ULTIMATE.start_cstpncpy_#in~dst.offset|) (select |#length| |ULTIMATE.start_cstpncpy_#in~dst.base|))) (.cse0 (<= (+ ULTIMATE.start_cstpncpy_~n ULTIMATE.start_cstpncpy_~d~0.offset) (+ (select |#length| ULTIMATE.start_cstpncpy_~d~0.base) 1))) (.cse6 (or (= (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset) 1) (and (<= 1 ULTIMATE.start_main_~length~0) .cse9))) (.cse8 (<= |ULTIMATE.start_cstpncpy_#in~dst.offset| 0)) (.cse7 (<= 1 ULTIMATE.start_cstpncpy_~n))) (or (and .cse0 (and (and .cse1 (and (not (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base)) (and (and (and .cse2 .cse3) .cse4 .cse5 .cse6) .cse7) (not (= |ULTIMATE.start_cstpncpy_~#dst.base| ULTIMATE.start_cstpncpy_~s~0.base)) (not (= ULTIMATE.start_cstpncpy_~d~0.base ULTIMATE.start_cstpncpy_~s~0.base)) (exists ((ULTIMATE.start_main_~nondetString~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstpncpy_~s~0.base) (+ (select |#length| ULTIMATE.start_cstpncpy_~s~0.base) ULTIMATE.start_main_~nondetString~0.offset (- 1)))) (<= ULTIMATE.start_main_~nondetString~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString~0.offset)))) (not (= |ULTIMATE.start_cstpncpy_~#dst.base| |ULTIMATE.start_cstpncpy_#in~dst.base|))) .cse8)) (and (and (and .cse5 (and .cse3 (and .cse2 .cse1 .cse4 (<= (+ ULTIMATE.start_main_~nondetArea~0.base 1) 0) .cse0)) .cse6) .cse8) .cse7)))) 362.23/278.92 [2019-03-28 12:41:53,908 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 21) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,908 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 13 21) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,908 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,909 INFO L444 ceAbstractionStarter]: At program point L13-4(lines 13 21) the Hoare annotation is: (let ((.cse59 (select |#length| ULTIMATE.start_cstpncpy_~d~0.base)) (.cse62 (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src.base|)) (.cse69 (select |#length| ULTIMATE.start_main_~nondetString~0.base))) (let ((.cse23 (= (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset) 1)) (.cse3 (= ULTIMATE.start_main_~length~0 .cse69)) (.cse73 (= |ULTIMATE.start_cstpncpy_~#dst.base| |ULTIMATE.start_cstpncpy_#in~dst.base|)) (.cse74 (select (select |#memory_int| ULTIMATE.start_cstpncpy_~s~0.base) ULTIMATE.start_cstpncpy_~s~0.offset)) (.cse68 (select |#memory_int| ULTIMATE.start_main_~nondetString~0.base)) (.cse75 (select (select |#memory_int| ULTIMATE.start_cstpncpy_~src.base) ULTIMATE.start_cstpncpy_~src.offset)) (.cse76 (select .cse62 |ULTIMATE.start_cstpncpy_#in~src.offset|)) (.cse61 (<= |ULTIMATE.start_cstpncpy_#in~src.offset| 0)) (.cse63 (select |#length| |ULTIMATE.start_cstpncpy_#in~src.base|)) (.cse72 (select |#length| |ULTIMATE.start_cstpncpy_#in~dst.base|)) (.cse56 (<= (+ ULTIMATE.start_cstpncpy_~n ULTIMATE.start_cstpncpy_~d~0.offset) .cse59)) (.cse70 (<= ULTIMATE.start_cstpncpy_~d~0.offset 0)) (.cse58 (<= ULTIMATE.start_cstpncpy_~s~0.offset 0)) (.cse71 (select |#length| ULTIMATE.start_cstpncpy_~s~0.base))) (let ((.cse39 (or .cse58 (<= (+ ULTIMATE.start_cstpncpy_~s~0.offset 3) .cse71))) (.cse52 (exists ((ULTIMATE.start_main_~nondetString~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString~0.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString~0.base) ULTIMATE.start_main_~nondetString~0.offset (- 1)))) (<= 0 ULTIMATE.start_main_~nondetString~0.offset)))) (.cse1 (or .cse56 (and .cse70 (= |ULTIMATE.start_cstpncpy_~#dst.base| ULTIMATE.start_cstpncpy_~d~0.base)))) (.cse43 (exists ((ULTIMATE.start_main_~nondetString~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString~0.offset) (= 0 (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src.base|) (+ (select |#length| |ULTIMATE.start_cstpncpy_#in~src.base|) ULTIMATE.start_main_~nondetString~0.offset (- 1))))))) (.cse44 (not (= |ULTIMATE.start_cstpncpy_#in~src.base| |ULTIMATE.start_cstpncpy_#in~dst.base|))) (.cse46 (<= |ULTIMATE.start_cstpncpy_#in~n| .cse72)) (.cse48 (<= (+ ULTIMATE.start_cstpncpy_~d~0.base 1) 0)) (.cse49 (< 0 |ULTIMATE.start_cstpncpy_#in~src.base|)) (.cse53 (<= (+ |ULTIMATE.start_cstpncpy_#in~dst.base| 1) 0)) (.cse50 (< 0 ULTIMATE.start_cstpncpy_~s~0.base)) (.cse51 (< 0 ULTIMATE.start_main_~nondetString~0.base)) (.cse42 (or (<= (+ |ULTIMATE.start_cstpncpy_#in~src.offset| 3) .cse63) .cse61 (<= .cse63 1))) (.cse0 (not (= ULTIMATE.start_cstpncpy_~src.base |ULTIMATE.start_cstpncpy_~#dst.base|))) (.cse7 (<= 0 .cse76)) (.cse54 (<= (+ ULTIMATE.start_main_~nondetArea~0.base 1) 0)) (.cse11 (<= .cse76 0)) (.cse13 (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_cstpncpy_~#dst.base|) |ULTIMATE.start_cstpncpy_~#dst.offset|))) (.cse15 (<= 0 .cse75)) (.cse16 (not (= |ULTIMATE.start_cstpncpy_#in~src.base| |ULTIMATE.start_cstpncpy_~#dst.base|))) (.cse19 (<= 0 ULTIMATE.start_cstpncpy_~d~0.offset)) (.cse24 (or (= (select .cse68 ULTIMATE.start_main_~nondetString~0.offset) ULTIMATE.start_main_~nondetString~0.offset) (<= 2 (+ .cse69 ULTIMATE.start_main_~nondetString~0.offset)))) (.cse25 (<= .cse75 0)) (.cse29 (exists ((v_prenex_1 Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_cstpncpy_#in~src.base|) v_prenex_1) 0) (<= (+ v_prenex_1 1) (select |#length| |ULTIMATE.start_cstpncpy_#in~src.base|)) (<= |ULTIMATE.start_cstpncpy_#in~src.offset| v_prenex_1)))) (.cse33 (<= .cse74 0)) (.cse34 (exists ((v_prenex_1 Int)) (and (<= (+ v_prenex_1 1) (select |#length| ULTIMATE.start_cstpncpy_~src.base)) (<= ULTIMATE.start_cstpncpy_~src.offset v_prenex_1) (= 0 (select (select |#memory_int| ULTIMATE.start_cstpncpy_~src.base) v_prenex_1))))) (.cse35 (exists ((ULTIMATE.start_main_~length~0 Int) (ULTIMATE.start_main_~nondetString~0.offset Int)) (and (= (select (select |#memory_int| ULTIMATE.start_cstpncpy_~s~0.base) (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset (- 1))) 0) (<= 1 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_cstpncpy_~s~0.offset ULTIMATE.start_main_~nondetString~0.offset) (<= (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset) (select |#length| ULTIMATE.start_cstpncpy_~s~0.base))))) (.cse36 (<= 0 .cse74)) (.cse45 (= ULTIMATE.start_main_~n~0 (select |#length| ULTIMATE.start_main_~nondetArea~0.base))) (.cse60 (not .cse73)) (.cse38 (not (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base))) (.cse10 (not (= |ULTIMATE.start_cstpncpy_~#dst.base| ULTIMATE.start_cstpncpy_~s~0.base))) (.cse40 (not (= ULTIMATE.start_cstpncpy_~d~0.base ULTIMATE.start_cstpncpy_~s~0.base))) (.cse2 (<= 0 ULTIMATE.start_cstpncpy_~src.offset)) (.cse20 (<= 0 |ULTIMATE.start_cstpncpy_~#dst.offset|)) (.cse4 (<= 0 |ULTIMATE.start_cstpncpy_#in~dst.offset|)) (.cse5 (<= 1 ULTIMATE.start_main_~n~0)) (.cse6 (<= 0 |ULTIMATE.start_cstpncpy_#in~src.offset|)) (.cse21 (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1)) (.cse22 (<= 1 |ULTIMATE.start_cstpncpy_#in~n|)) (.cse8 (= ULTIMATE.start_main_~nondetString~0.offset 0)) (.cse9 (= (select |#valid| |ULTIMATE.start_cstpncpy_~#dst.base|) 1)) (.cse12 (= (select |#valid| ULTIMATE.start_cstpncpy_~s~0.base) 1)) (.cse26 (= (select |#valid| ULTIMATE.start_cstpncpy_~src.base) 1)) (.cse27 (= 8 (select |#length| |ULTIMATE.start_cstpncpy_~#dst.base|))) (.cse64 (<= (+ ULTIMATE.start_cstpncpy_~src.offset 1) (select |#length| ULTIMATE.start_cstpncpy_~src.base))) (.cse28 (= 1 (select |#valid| ULTIMATE.start_cstpncpy_~d~0.base))) (.cse65 (<= (+ |ULTIMATE.start_cstpncpy_#in~src.offset| 1) .cse63)) (.cse14 (= 1 (select |#valid| |ULTIMATE.start_cstpncpy_#in~src.base|))) (.cse30 (<= 0 ULTIMATE.start_cstpncpy_~s~0.offset)) (.cse31 (<= |ULTIMATE.start_cstpncpy_~#dst.offset| 0)) (.cse32 (or (= (select |#valid| |ULTIMATE.start_cstpncpy_#in~dst.base|) 1) .cse73)) (.cse17 (= ULTIMATE.start_main_~nondetArea~0.offset ULTIMATE.start_main_~nondetString~0.offset)) (.cse66 (<= 1 ULTIMATE.start_cstpncpy_~d~0.offset)) (.cse18 (= (select |#valid| ULTIMATE.start_main_~nondetString~0.base) 1)) (.cse55 (<= (+ |ULTIMATE.start_cstpncpy_#in~n| |ULTIMATE.start_cstpncpy_#in~dst.offset|) .cse72)) (.cse47 (<= |ULTIMATE.start_cstpncpy_#in~dst.offset| 0)) (.cse57 (or .cse23 (and (<= 1 ULTIMATE.start_main_~length~0) .cse3))) (.cse41 (exists ((ULTIMATE.start_main_~nondetString~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstpncpy_~s~0.base) (+ (select |#length| ULTIMATE.start_cstpncpy_~s~0.base) ULTIMATE.start_main_~nondetString~0.offset (- 1)))) (<= ULTIMATE.start_main_~nondetString~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString~0.offset)))) (.cse37 (<= 1 ULTIMATE.start_cstpncpy_~n)) (.cse67 (<= (+ ULTIMATE.start_cstpncpy_~s~0.offset 1) .cse71))) (or (and (and (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) .cse37) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44) .cse45 (<= 1 ULTIMATE.start_main_~nondetArea~0.base) .cse46 (< 0 |ULTIMATE.start_cstpncpy_#in~dst.base|) (< |ULTIMATE.start_cstpncpy_~#dst.base| 0) .cse47 (< 0 ULTIMATE.start_cstpncpy_~d~0.base)) (and .cse48 .cse49 .cse50 .cse39 .cse51 .cse42 .cse43 .cse52 .cse16 .cse53 .cse41 (and .cse37 (and (and .cse0 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse21 .cse22 .cse54 .cse8 .cse9 .cse55 .cse10 .cse12 .cse26 .cse27 .cse28 .cse13 .cse45 .cse29 .cse14 .cse56 .cse30 .cse31 .cse32 .cse34 .cse35 .cse17 .cse18 .cse19 .cse57) .cse47))) (and (and .cse58 .cse16 (and .cse45 (<= ULTIMATE.start_cstpncpy_~n .cse59) (and .cse52 .cse38 .cse40 .cse41 (and (and .cse0 .cse1 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse21 .cse22 .cse8 .cse9 .cse10 .cse12 .cse26 .cse27 .cse28 .cse13 .cse29 .cse14 .cse30 .cse31 .cse32 .cse34 .cse35 .cse17 .cse18 .cse19 .cse57) .cse37) .cse43 .cse44) .cse60 .cse46) .cse61) .cse47 (exists ((|ULTIMATE.start_cstpncpy_~#dst.base| Int)) (and (not (= |ULTIMATE.start_cstpncpy_~#dst.base| ULTIMATE.start_cstpncpy_~d~0.base)) (= 8 (select |#length| |ULTIMATE.start_cstpncpy_~#dst.base|))))) (and .cse48 .cse49 .cse53 .cse50 (= (select .cse62 (+ .cse63 (- 1))) 0) .cse51 (and .cse10 .cse41 .cse37 (and (and .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse21 .cse22 .cse54 .cse8 .cse9 .cse55 .cse12 .cse26 .cse27 .cse64 .cse28 .cse45 .cse65 .cse14 .cse30 .cse31 .cse56 .cse32 (or (< 1 ULTIMATE.start_main_~length~0) (= ULTIMATE.start_main_~length~0 1)) .cse17 .cse66 .cse18) .cse47) .cse67) (= (select .cse68 (+ .cse69 (- 1))) 0) .cse42) (and (and (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse54 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse55 .cse24 .cse25 .cse26 .cse27 .cse28 .cse45 .cse29 .cse56 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) .cse70 .cse47) .cse37) (and (and .cse45 .cse60 (and .cse38 .cse10 .cse40 (and (and .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse21 .cse22 .cse8 .cse9 .cse12 .cse26 .cse27 .cse64 .cse28 .cse65 .cse14 .cse30 .cse31 .cse32 .cse17 .cse66 .cse18 .cse55) .cse47 .cse57) .cse41 .cse37 .cse67)) .cse56))))) 362.23/278.92 [2019-03-28 12:41:53,909 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,909 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,909 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 24) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,909 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,909 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,909 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(lines 5 24) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,910 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,910 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,910 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,910 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,910 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,910 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,910 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,910 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 14 20) no Hoare annotation was computed. 362.23/278.92 [2019-03-28 12:41:53,911 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 362.23/278.92 [2019-03-28 12:41:53,921 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,922 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.23/278.92 [2019-03-28 12:41:53,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,941 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,941 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,942 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,944 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,944 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,944 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,945 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,945 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,945 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,946 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,946 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,946 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.23/278.92 [2019-03-28 12:41:53,947 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,947 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,947 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,948 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,948 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,948 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,948 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,949 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,949 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.23/278.92 [2019-03-28 12:41:53,956 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.23/278.92 [2019-03-28 12:41:53,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,959 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,959 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,959 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,960 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,960 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,960 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,966 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.23/278.92 [2019-03-28 12:41:53,966 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,967 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,967 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,967 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,972 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.23/278.92 [2019-03-28 12:41:53,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.23/278.92 [2019-03-28 12:41:53,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_cstpncpy_~#dst.base,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_cstpncpy_~#dst.base,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.92 [2019-03-28 12:41:53,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:53,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:53,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:53,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:53,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:53,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ 362.28/278.92 [2019-03-28 12:41:53,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:53,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:53,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:53,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:53,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:53,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:53,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:53,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:53,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:53,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:53,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:53,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:53,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:53,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:53,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:53,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:53,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:53,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:53,998 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:53,998 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:53,998 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:53,998 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:53,999 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:53,999 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:53,999 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:53,999 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,000 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,000 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,000 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,001 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,001 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,001 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,002 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,002 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,002 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ 362.28/278.92 [2019-03-28 12:41:54,003 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,003 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,003 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,004 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,004 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,004 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,004 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,005 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,005 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,005 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,005 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,006 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,006 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,006 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,007 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,007 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,007 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,008 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,008 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ 362.28/278.92 [2019-03-28 12:41:54,009 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,009 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,009 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,010 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,010 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,010 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,011 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,011 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,011 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,014 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,014 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,014 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,015 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,015 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,015 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,017 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,017 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,018 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ 362.28/278.92 [2019-03-28 12:41:54,018 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,019 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,019 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,019 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,019 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,021 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,021 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,021 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,021 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,022 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,022 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,022 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,022 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,024 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,024 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,024 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,024 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,025 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,025 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,025 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,025 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,028 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.92 [2019-03-28 12:41:54,029 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,033 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,033 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,033 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,034 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,034 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,034 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,034 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,037 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,037 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,037 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,037 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,038 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.92 [2019-03-28 12:41:54,038 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,038 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,039 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,039 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,039 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,039 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,042 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,042 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,042 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,042 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,043 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,043 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.92 [2019-03-28 12:41:54,043 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,048 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,048 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,048 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_cstpncpy_~#dst.base,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,048 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_cstpncpy_~#dst.base,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,049 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,049 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,049 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,050 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.92 [2019-03-28 12:41:54,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,052 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,052 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,052 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,052 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,053 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,053 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,053 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,054 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,054 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.92 [2019-03-28 12:41:54,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,058 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,058 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,059 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ 362.28/278.92 [2019-03-28 12:41:54,059 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,060 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,060 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,061 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,061 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,061 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,062 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,062 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,065 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,065 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,065 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,066 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,066 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,066 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,066 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,067 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,067 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,067 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,068 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,068 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,068 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,068 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,069 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,069 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,069 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,070 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,070 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,070 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ 362.28/278.92 [2019-03-28 12:41:54,071 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,071 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,071 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,072 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,072 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,072 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,072 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,073 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,073 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,073 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,074 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,074 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,074 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,074 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,075 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,075 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,075 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,076 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,076 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ 362.28/278.92 [2019-03-28 12:41:54,077 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,077 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,077 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,078 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,078 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,078 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,079 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,079 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,079 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,079 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,080 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,080 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,080 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,080 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,081 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,081 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,081 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,082 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,082 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,082 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,083 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,083 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,083 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,083 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,083 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,084 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,084 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,084 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,085 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,085 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,085 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ 362.28/278.92 [2019-03-28 12:41:54,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,087 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,087 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,087 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,088 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,088 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,088 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,088 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,089 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,089 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,089 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,089 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,090 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,090 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,090 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,090 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,091 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,091 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,091 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,092 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,092 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,092 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.92 [2019-03-28 12:41:54,092 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,093 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,093 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.92 [2019-03-28 12:41:54,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:41:54 BasicIcfg 362.28/278.92 [2019-03-28 12:41:54,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 362.28/278.92 [2019-03-28 12:41:54,097 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 362.28/278.92 [2019-03-28 12:41:54,097 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 362.28/278.92 [2019-03-28 12:41:54,101 INFO L276 PluginConnector]: BuchiAutomizer initialized 362.28/278.92 [2019-03-28 12:41:54,102 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 362.28/278.92 [2019-03-28 12:41:54,102 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:37:46" (1/5) ... 362.28/278.92 [2019-03-28 12:41:54,102 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b0602a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:41:54, skipping insertion in model container 362.28/278.92 [2019-03-28 12:41:54,103 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 362.28/278.92 [2019-03-28 12:41:54,103 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:46" (2/5) ... 362.28/278.92 [2019-03-28 12:41:54,103 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b0602a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:41:54, skipping insertion in model container 362.28/278.92 [2019-03-28 12:41:54,103 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 362.28/278.92 [2019-03-28 12:41:54,103 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:47" (3/5) ... 362.28/278.92 [2019-03-28 12:41:54,103 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b0602a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:54, skipping insertion in model container 362.28/278.92 [2019-03-28 12:41:54,104 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 362.28/278.92 [2019-03-28 12:41:54,104 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:37:47" (4/5) ... 362.28/278.92 [2019-03-28 12:41:54,104 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b0602a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:54, skipping insertion in model container 362.28/278.92 [2019-03-28 12:41:54,104 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 362.28/278.92 [2019-03-28 12:41:54,104 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:41:54" (5/5) ... 362.28/278.92 [2019-03-28 12:41:54,106 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 362.28/278.92 [2019-03-28 12:41:54,128 INFO L133 ementStrategyFactory]: Using default assertion order modulation 362.28/278.92 [2019-03-28 12:41:54,128 INFO L374 BuchiCegarLoop]: Interprodecural is true 362.28/278.92 [2019-03-28 12:41:54,128 INFO L375 BuchiCegarLoop]: Hoare is true 362.28/278.92 [2019-03-28 12:41:54,129 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 362.28/278.92 [2019-03-28 12:41:54,129 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 362.28/278.92 [2019-03-28 12:41:54,129 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 362.28/278.92 [2019-03-28 12:41:54,129 INFO L379 BuchiCegarLoop]: Difference is false 362.28/278.92 [2019-03-28 12:41:54,129 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 362.28/278.92 [2019-03-28 12:41:54,129 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 362.28/278.92 [2019-03-28 12:41:54,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states. 362.28/278.92 [2019-03-28 12:41:54,139 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 362.28/278.92 [2019-03-28 12:41:54,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 362.28/278.92 [2019-03-28 12:41:54,139 INFO L119 BuchiIsEmpty]: Starting construction of run 362.28/278.92 [2019-03-28 12:41:54,143 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.28/278.92 [2019-03-28 12:41:54,144 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 362.28/278.92 [2019-03-28 12:41:54,144 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 362.28/278.92 [2019-03-28 12:41:54,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states. 362.28/278.92 [2019-03-28 12:41:54,146 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 362.28/278.92 [2019-03-28 12:41:54,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 362.28/278.92 [2019-03-28 12:41:54,146 INFO L119 BuchiIsEmpty]: Starting construction of run 362.28/278.92 [2019-03-28 12:41:54,146 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.28/278.92 [2019-03-28 12:41:54,146 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 362.28/278.92 [2019-03-28 12:41:54,152 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRYtrue [236] ULTIMATE.startENTRY-->L29: Formula: (and (= (store |v_#valid_34| 0 0) |v_#valid_33|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_34|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_33|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_#t~ret13.base, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 10#L29true [154] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 6#L29-2true [95] L29-2-->L32-1: Formula: (and (= v_ULTIMATE.start_main_~n~0_4 1) (< v_ULTIMATE.start_main_~n~0_5 1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0] 13#L32-1true [185] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2| 1))) (and (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2| 1)) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2|) 0) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2|)) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (< |v_ULTIMATE.start_main_#t~malloc12.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc12.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_2| v_ULTIMATE.start_main_~length~0_7)))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_#t~malloc11.base, #length] 27#L37true [117] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8 (- 1))) (.cse1 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8))) (and (= |v_#memory_$Pointer$.offset_1| (store |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 (select (select |v_#memory_$Pointer$.offset_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0)))) (<= .cse1 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString~0.base_3)) (= (store |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 (select (select |v_#memory_$Pointer$.base_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0))) |v_#memory_$Pointer$.base_1|) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 0))) (<= 1 .cse1) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString~0.base_3)))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 44#L37-1true [191] L37-1-->L5: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#in~dst.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_3) (< |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 0) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1|)) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 8)) (< |v_ULTIMATE.start_cstpncpy_~#dst.base_1| |v_#StackHeapBarrier_2|) (= |v_ULTIMATE.start_cstpncpy_#in~dst.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_3) (= |v_ULTIMATE.start_cstpncpy_#in~n_1| v_ULTIMATE.start_main_~n~0_8) (= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_1|) (= |v_ULTIMATE.start_cstpncpy_#in~src.offset_1| v_ULTIMATE.start_main_~nondetString~0.offset_5) (= (store |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 1) |v_#valid_8|) (= |v_ULTIMATE.start_cstpncpy_#in~src.base_1| v_ULTIMATE.start_main_~nondetString~0.base_6)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, #valid=|v_#valid_9|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, #length=|v_#length_7|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_1, ULTIMATE.start_cstpncpy_#t~mem8.base=|v_ULTIMATE.start_cstpncpy_#t~mem8.base_1|, ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_1|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_1|, ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_1|, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_1|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_1|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_1, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_1|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_1, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_1, ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_1|, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_1|, ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_1|, #length=|v_#length_6|, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_1|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_1|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_1, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_1|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_1|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_1|, ULTIMATE.start_cstpncpy_#res.base=|v_ULTIMATE.start_cstpncpy_#res.base_1|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_1|, ULTIMATE.start_cstpncpy_#res.offset=|v_ULTIMATE.start_cstpncpy_#res.offset_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem8.offset=|v_ULTIMATE.start_cstpncpy_#t~mem8.offset_1|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_1, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, #valid=|v_#valid_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_1|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_1|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_#t~mem8.base, ULTIMATE.start_cstpncpy_#t~post7.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#in~src.offset, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~#dst.offset, ULTIMATE.start_cstpncpy_~src.base, ULTIMATE.start_cstpncpy_#in~dst.base, ULTIMATE.start_cstpncpy_#t~mem5, ULTIMATE.start_cstpncpy_~n, ULTIMATE.start_cstpncpy_~s~0.offset, ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~pre2, #length, ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_#in~n, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_#t~mem1.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#res.base, ULTIMATE.start_cstpncpy_#in~src.base, ULTIMATE.start_cstpncpy_#res.offset, ULTIMATE.start_cstpncpy_~#dst.base, ULTIMATE.start_cstpncpy_#t~mem8.offset, ULTIMATE.start_cstpncpy_~src.offset, ULTIMATE.start_cstpncpy_~d~0.offset, #valid, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#in~dst.offset, ULTIMATE.start_cstpncpy_#t~post7.base] 4#L5true [237] L5-->L8: Formula: (and (= v_ULTIMATE.start_cstpncpy_~src.offset_4 |v_ULTIMATE.start_cstpncpy_#in~src.offset_3|) (= (store |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|)) |v_#memory_$Pointer$.offset_16|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|) (= (store |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.base_3|)) |v_#memory_$Pointer$.base_16|) (= v_ULTIMATE.start_cstpncpy_~src.base_4 |v_ULTIMATE.start_cstpncpy_#in~src.base_3|) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| 8) (select |v_#length_26| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|)) (= v_ULTIMATE.start_cstpncpy_~n_10 |v_ULTIMATE.start_cstpncpy_#in~n_3|) (= 1 (select |v_#valid_35| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|)) (= (store |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| (select (select |v_#memory_int_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|))) |v_#memory_int_14|)) InVars {ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} OutVars{ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_16|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_4, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_10, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_4, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~src.offset, #memory_$Pointer$.base, ULTIMATE.start_cstpncpy_~src.base, #memory_int, ULTIMATE.start_cstpncpy_~n, #memory_$Pointer$.offset] 34#L8true [197] L8-->L9: Formula: (< v_ULTIMATE.start_cstpncpy_~n_3 0) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} OutVars{ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} AuxVars[] AssignedVars[] 11#L9true [239] L9-->L12: Formula: (and (= (select |v_#valid_38| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) 1) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_20| 8) (select |v_#length_28| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|)) (= (select (select |v_#memory_$Pointer$.base_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) v_ULTIMATE.start_cstpncpy_~d~0.base_8) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_8 (select (select |v_#memory_$Pointer$.offset_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|)) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) (= v_ULTIMATE.start_cstpncpy_~src.offset_5 v_ULTIMATE.start_cstpncpy_~s~0.offset_5) (= v_ULTIMATE.start_cstpncpy_~src.base_5 v_ULTIMATE.start_cstpncpy_~s~0.base_5)) InVars {ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_8, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_5, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_8, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_5|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_5, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 18#L12true [141] L12-->L12-1: Formula: (and (= (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|) (= (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) (= (select |v_#valid_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) 1) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_7| 8) (select |v_#length_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem1.offset] 16#L12-1true [243] L12-1-->L13-4: Formula: (and (= (store |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (select (select |v_#memory_int_16| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|))) |v_#memory_int_16|) (= |v_#memory_$Pointer$.offset_23| (store |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (+ (mod v_ULTIMATE.start_cstpncpy_~n_11 4294967296) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|)))) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| 8) (select |v_#length_32| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (= (store |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| |v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|)) |v_#memory_$Pointer$.base_23|) (= 1 (select |v_#valid_46| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|)) InVars {ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_24|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_24|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_23|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_16|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_23|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset, ULTIMATE.start_cstpncpy_#t~mem1.offset] 12#L13-4true 362.28/278.92 [2019-03-28 12:41:54,153 INFO L796 eck$LassoCheckResult]: Loop: 12#L13-4true [134] L13-4-->L14: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| v_ULTIMATE.start_cstpncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| v_ULTIMATE.start_cstpncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| 1)) (= |v_ULTIMATE.start_cstpncpy_#t~post3.base_2| v_ULTIMATE.start_cstpncpy_~d~0.base_4) (= v_ULTIMATE.start_cstpncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| 1)) (= v_ULTIMATE.start_cstpncpy_~s~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post4.base_2|) (= v_ULTIMATE.start_cstpncpy_~d~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post3.base_2|) (= |v_ULTIMATE.start_cstpncpy_#t~post4.base_2| v_ULTIMATE.start_cstpncpy_~s~0.base_4)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_4, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_4, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_4, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_4} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_3, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_2|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_2|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_2|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_2|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_3, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 23#L14true [111] L14-->L14-1: Formula: (and (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) (= (select |v_#valid_18| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) 1) (= (select (select |v_#memory_int_7| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) |v_ULTIMATE.start_cstpncpy_#t~mem5_2|) (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_16|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_2|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem5] 20#L14-1true [107] L14-1-->L14-2: Formula: (and (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| 1) (select |v_#length_18| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (= (store |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.base_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.base_9|) (= (store |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.offset_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.offset_9|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|) (= |v_#memory_int_8| (store |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| |v_ULTIMATE.start_cstpncpy_#t~mem5_3|)))) InVars {ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_10|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_10|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_9|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 19#L14-2true [222] L14-2-->L13-1: Formula: (< 0 |v_ULTIMATE.start_cstpncpy_#t~mem5_7|) InVars {ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_7|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_6|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_6|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_6|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_7|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#t~mem5] 40#L13-1true [153] L13-1-->L13-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstpncpy_~n_8 (- 1)))) (and (= |v_ULTIMATE.start_cstpncpy_#t~pre2_2| .cse0) (= v_ULTIMATE.start_cstpncpy_~n_7 .cse0))) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_8} OutVars{ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_2|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre2, ULTIMATE.start_cstpncpy_~n] 39#L13-2true [228] L13-2-->L13-4: Formula: (< 0 |v_ULTIMATE.start_cstpncpy_#t~pre2_6|) InVars {ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_6|} OutVars{ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre2] 12#L13-4true 362.28/278.92 [2019-03-28 12:41:54,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.92 [2019-03-28 12:41:54,154 INFO L82 PathProgramCache]: Analyzing trace with hash -698175350, now seen corresponding path program 1 times 362.28/278.92 [2019-03-28 12:41:54,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.92 [2019-03-28 12:41:54,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.92 [2019-03-28 12:41:54,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.28/278.92 [2019-03-28 12:41:54,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.28/278.92 [2019-03-28 12:41:54,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.28/278.92 [2019-03-28 12:41:54,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 362.28/278.92 [2019-03-28 12:41:54,177 INFO L799 eck$LassoCheckResult]: stem already infeasible 362.28/278.92 [2019-03-28 12:41:54,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.92 [2019-03-28 12:41:54,178 INFO L82 PathProgramCache]: Analyzing trace with hash 534759400, now seen corresponding path program 1 times 362.28/278.92 [2019-03-28 12:41:54,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.92 [2019-03-28 12:41:54,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.92 [2019-03-28 12:41:54,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.92 [2019-03-28 12:41:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.92 [2019-03-28 12:41:54,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 362.28/278.92 [2019-03-28 12:41:54,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 362.28/278.92 [2019-03-28 12:41:54,340 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. 362.28/278.92 [2019-03-28 12:41:54,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.28/278.92 [2019-03-28 12:41:54,484 INFO L93 Difference]: Finished difference Result 55 states and 94 transitions. 362.28/278.92 [2019-03-28 12:41:54,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 362.28/278.92 [2019-03-28 12:41:54,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 94 transitions. 362.28/278.92 [2019-03-28 12:41:54,489 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 362.28/278.92 [2019-03-28 12:41:54,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 28 states and 40 transitions. 362.28/278.92 [2019-03-28 12:41:54,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 362.28/278.92 [2019-03-28 12:41:54,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 362.28/278.92 [2019-03-28 12:41:54,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 40 transitions. 362.28/278.92 [2019-03-28 12:41:54,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 362.28/278.92 [2019-03-28 12:41:54,493 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. 362.28/278.92 [2019-03-28 12:41:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 40 transitions. 362.28/278.92 [2019-03-28 12:41:54,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. 362.28/278.92 [2019-03-28 12:41:54,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 362.28/278.92 [2019-03-28 12:41:54,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. 362.28/278.92 [2019-03-28 12:41:54,496 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. 362.28/278.92 [2019-03-28 12:41:54,496 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. 362.28/278.92 [2019-03-28 12:41:54,496 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 362.28/278.92 [2019-03-28 12:41:54,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 31 transitions. 362.28/278.92 [2019-03-28 12:41:54,497 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 362.28/278.92 [2019-03-28 12:41:54,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 362.28/278.92 [2019-03-28 12:41:54,497 INFO L119 BuchiIsEmpty]: Starting construction of run 362.28/278.92 [2019-03-28 12:41:54,497 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.28/278.92 [2019-03-28 12:41:54,497 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 362.28/278.92 [2019-03-28 12:41:54,498 INFO L794 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY [236] ULTIMATE.startENTRY-->L29: Formula: (and (= (store |v_#valid_34| 0 0) |v_#valid_33|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_34|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_33|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_#t~ret13.base, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 122#L29 [154] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 119#L29-2 [95] L29-2-->L32-1: Formula: (and (= v_ULTIMATE.start_main_~n~0_4 1) (< v_ULTIMATE.start_main_~n~0_5 1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0] 120#L32-1 [185] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2| 1))) (and (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2| 1)) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2|) 0) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2|)) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (< |v_ULTIMATE.start_main_#t~malloc12.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc12.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_2| v_ULTIMATE.start_main_~length~0_7)))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_#t~malloc11.base, #length] 115#L37 [117] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8 (- 1))) (.cse1 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8))) (and (= |v_#memory_$Pointer$.offset_1| (store |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 (select (select |v_#memory_$Pointer$.offset_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0)))) (<= .cse1 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString~0.base_3)) (= (store |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 (select (select |v_#memory_$Pointer$.base_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0))) |v_#memory_$Pointer$.base_1|) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 0))) (<= 1 .cse1) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString~0.base_3)))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 116#L37-1 [191] L37-1-->L5: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#in~dst.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_3) (< |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 0) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1|)) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 8)) (< |v_ULTIMATE.start_cstpncpy_~#dst.base_1| |v_#StackHeapBarrier_2|) (= |v_ULTIMATE.start_cstpncpy_#in~dst.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_3) (= |v_ULTIMATE.start_cstpncpy_#in~n_1| v_ULTIMATE.start_main_~n~0_8) (= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_1|) (= |v_ULTIMATE.start_cstpncpy_#in~src.offset_1| v_ULTIMATE.start_main_~nondetString~0.offset_5) (= (store |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 1) |v_#valid_8|) (= |v_ULTIMATE.start_cstpncpy_#in~src.base_1| v_ULTIMATE.start_main_~nondetString~0.base_6)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, #valid=|v_#valid_9|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, #length=|v_#length_7|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_1, ULTIMATE.start_cstpncpy_#t~mem8.base=|v_ULTIMATE.start_cstpncpy_#t~mem8.base_1|, ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_1|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_1|, ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_1|, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_1|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_1|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_1, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_1|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_1, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_1, ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_1|, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_1|, ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_1|, #length=|v_#length_6|, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_1|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_1|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_1, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_1|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_1|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_1|, ULTIMATE.start_cstpncpy_#res.base=|v_ULTIMATE.start_cstpncpy_#res.base_1|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_1|, ULTIMATE.start_cstpncpy_#res.offset=|v_ULTIMATE.start_cstpncpy_#res.offset_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem8.offset=|v_ULTIMATE.start_cstpncpy_#t~mem8.offset_1|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_1, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, #valid=|v_#valid_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_1|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_1|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_#t~mem8.base, ULTIMATE.start_cstpncpy_#t~post7.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#in~src.offset, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~#dst.offset, ULTIMATE.start_cstpncpy_~src.base, ULTIMATE.start_cstpncpy_#in~dst.base, ULTIMATE.start_cstpncpy_#t~mem5, ULTIMATE.start_cstpncpy_~n, ULTIMATE.start_cstpncpy_~s~0.offset, ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~pre2, #length, ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_#in~n, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_#t~mem1.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#res.base, ULTIMATE.start_cstpncpy_#in~src.base, ULTIMATE.start_cstpncpy_#res.offset, ULTIMATE.start_cstpncpy_~#dst.base, ULTIMATE.start_cstpncpy_#t~mem8.offset, ULTIMATE.start_cstpncpy_~src.offset, ULTIMATE.start_cstpncpy_~d~0.offset, #valid, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#in~dst.offset, ULTIMATE.start_cstpncpy_#t~post7.base] 117#L5 [237] L5-->L8: Formula: (and (= v_ULTIMATE.start_cstpncpy_~src.offset_4 |v_ULTIMATE.start_cstpncpy_#in~src.offset_3|) (= (store |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|)) |v_#memory_$Pointer$.offset_16|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|) (= (store |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.base_3|)) |v_#memory_$Pointer$.base_16|) (= v_ULTIMATE.start_cstpncpy_~src.base_4 |v_ULTIMATE.start_cstpncpy_#in~src.base_3|) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| 8) (select |v_#length_26| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|)) (= v_ULTIMATE.start_cstpncpy_~n_10 |v_ULTIMATE.start_cstpncpy_#in~n_3|) (= 1 (select |v_#valid_35| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|)) (= (store |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| (select (select |v_#memory_int_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|))) |v_#memory_int_14|)) InVars {ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} OutVars{ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_16|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_4, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_10, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_4, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~src.offset, #memory_$Pointer$.base, ULTIMATE.start_cstpncpy_~src.base, #memory_int, ULTIMATE.start_cstpncpy_~n, #memory_$Pointer$.offset] 118#L8 [196] L8-->L9: Formula: (> v_ULTIMATE.start_cstpncpy_~n_3 0) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} OutVars{ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} AuxVars[] AssignedVars[] 123#L9 [239] L9-->L12: Formula: (and (= (select |v_#valid_38| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) 1) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_20| 8) (select |v_#length_28| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|)) (= (select (select |v_#memory_$Pointer$.base_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) v_ULTIMATE.start_cstpncpy_~d~0.base_8) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_8 (select (select |v_#memory_$Pointer$.offset_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|)) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) (= v_ULTIMATE.start_cstpncpy_~src.offset_5 v_ULTIMATE.start_cstpncpy_~s~0.offset_5) (= v_ULTIMATE.start_cstpncpy_~src.base_5 v_ULTIMATE.start_cstpncpy_~s~0.base_5)) InVars {ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_8, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_5, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_8, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_5|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_5, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 124#L12 [141] L12-->L12-1: Formula: (and (= (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|) (= (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) (= (select |v_#valid_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) 1) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_7| 8) (select |v_#length_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem1.offset] 128#L12-1 [243] L12-1-->L13-4: Formula: (and (= (store |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (select (select |v_#memory_int_16| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|))) |v_#memory_int_16|) (= |v_#memory_$Pointer$.offset_23| (store |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (+ (mod v_ULTIMATE.start_cstpncpy_~n_11 4294967296) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|)))) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| 8) (select |v_#length_32| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (= (store |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| |v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|)) |v_#memory_$Pointer$.base_23|) (= 1 (select |v_#valid_46| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|)) InVars {ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_24|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_24|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_23|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_16|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_23|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset, ULTIMATE.start_cstpncpy_#t~mem1.offset] 125#L13-4 362.28/278.92 [2019-03-28 12:41:54,499 INFO L796 eck$LassoCheckResult]: Loop: 125#L13-4 [134] L13-4-->L14: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| v_ULTIMATE.start_cstpncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| v_ULTIMATE.start_cstpncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| 1)) (= |v_ULTIMATE.start_cstpncpy_#t~post3.base_2| v_ULTIMATE.start_cstpncpy_~d~0.base_4) (= v_ULTIMATE.start_cstpncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| 1)) (= v_ULTIMATE.start_cstpncpy_~s~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post4.base_2|) (= v_ULTIMATE.start_cstpncpy_~d~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post3.base_2|) (= |v_ULTIMATE.start_cstpncpy_#t~post4.base_2| v_ULTIMATE.start_cstpncpy_~s~0.base_4)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_4, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_4, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_4, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_4} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_3, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_2|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_2|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_2|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_2|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_3, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 126#L14 [111] L14-->L14-1: Formula: (and (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) (= (select |v_#valid_18| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) 1) (= (select (select |v_#memory_int_7| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) |v_ULTIMATE.start_cstpncpy_#t~mem5_2|) (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_16|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_2|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem5] 132#L14-1 [107] L14-1-->L14-2: Formula: (and (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| 1) (select |v_#length_18| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (= (store |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.base_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.base_9|) (= (store |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.offset_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.offset_9|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|) (= |v_#memory_int_8| (store |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| |v_ULTIMATE.start_cstpncpy_#t~mem5_3|)))) InVars {ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_10|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_10|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_9|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 130#L14-2 [222] L14-2-->L13-1: Formula: (< 0 |v_ULTIMATE.start_cstpncpy_#t~mem5_7|) InVars {ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_7|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_6|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_6|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_6|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_7|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#t~mem5] 131#L13-1 [153] L13-1-->L13-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstpncpy_~n_8 (- 1)))) (and (= |v_ULTIMATE.start_cstpncpy_#t~pre2_2| .cse0) (= v_ULTIMATE.start_cstpncpy_~n_7 .cse0))) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_8} OutVars{ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_2|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre2, ULTIMATE.start_cstpncpy_~n] 129#L13-2 [228] L13-2-->L13-4: Formula: (< 0 |v_ULTIMATE.start_cstpncpy_#t~pre2_6|) InVars {ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_6|} OutVars{ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre2] 125#L13-4 362.28/278.92 [2019-03-28 12:41:54,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.92 [2019-03-28 12:41:54,499 INFO L82 PathProgramCache]: Analyzing trace with hash -698205141, now seen corresponding path program 1 times 362.28/278.92 [2019-03-28 12:41:54,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.92 [2019-03-28 12:41:54,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.92 [2019-03-28 12:41:54,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.92 [2019-03-28 12:41:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.92 [2019-03-28 12:41:54,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.92 [2019-03-28 12:41:54,522 INFO L82 PathProgramCache]: Analyzing trace with hash 534759400, now seen corresponding path program 2 times 362.28/278.92 [2019-03-28 12:41:54,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.92 [2019-03-28 12:41:54,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.92 [2019-03-28 12:41:54,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.92 [2019-03-28 12:41:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.92 [2019-03-28 12:41:54,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.92 [2019-03-28 12:41:54,531 INFO L82 PathProgramCache]: Analyzing trace with hash -932529006, now seen corresponding path program 1 times 362.28/278.92 [2019-03-28 12:41:54,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.92 [2019-03-28 12:41:54,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.92 [2019-03-28 12:41:54,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.28/278.92 [2019-03-28 12:41:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.28/278.92 [2019-03-28 12:41:54,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.28/278.92 [2019-03-28 12:41:54,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 362.28/278.92 [2019-03-28 12:41:54,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 362.28/278.92 [2019-03-28 12:41:54,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 362.28/278.92 [2019-03-28 12:41:54,701 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. cyclomatic complexity: 12 Second operand 6 states. 362.28/278.92 [2019-03-28 12:41:54,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.28/278.92 [2019-03-28 12:41:54,827 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. 362.28/278.92 [2019-03-28 12:41:54,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 362.28/278.92 [2019-03-28 12:41:54,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 56 transitions. 362.28/278.92 [2019-03-28 12:41:54,829 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 362.28/278.92 [2019-03-28 12:41:54,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 56 transitions. 362.28/278.92 [2019-03-28 12:41:54,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 362.28/278.92 [2019-03-28 12:41:54,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 362.28/278.92 [2019-03-28 12:41:54,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 56 transitions. 362.28/278.92 [2019-03-28 12:41:54,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 362.28/278.92 [2019-03-28 12:41:54,831 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. 362.28/278.92 [2019-03-28 12:41:54,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 56 transitions. 362.28/278.92 [2019-03-28 12:41:54,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. 362.28/278.92 [2019-03-28 12:41:54,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 362.28/278.92 [2019-03-28 12:41:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 51 transitions. 362.28/278.92 [2019-03-28 12:41:54,833 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 51 transitions. 362.28/278.92 [2019-03-28 12:41:54,833 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 51 transitions. 362.28/278.92 [2019-03-28 12:41:54,833 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 362.28/278.92 [2019-03-28 12:41:54,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 51 transitions. 362.28/278.92 [2019-03-28 12:41:54,834 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 362.28/278.92 [2019-03-28 12:41:54,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 362.28/278.92 [2019-03-28 12:41:54,834 INFO L119 BuchiIsEmpty]: Starting construction of run 362.28/278.92 [2019-03-28 12:41:54,834 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.28/278.92 [2019-03-28 12:41:54,834 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 362.28/278.92 [2019-03-28 12:41:54,835 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY [236] ULTIMATE.startENTRY-->L29: Formula: (and (= (store |v_#valid_34| 0 0) |v_#valid_33|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_34|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_33|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_#t~ret13.base, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 200#L29 [154] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 196#L29-2 [155] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 197#L32-1 [185] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2| 1))) (and (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2| 1)) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2|) 0) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2|)) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (< |v_ULTIMATE.start_main_#t~malloc12.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc12.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_2| v_ULTIMATE.start_main_~length~0_7)))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_#t~malloc11.base, #length] 192#L37 [117] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8 (- 1))) (.cse1 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8))) (and (= |v_#memory_$Pointer$.offset_1| (store |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 (select (select |v_#memory_$Pointer$.offset_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0)))) (<= .cse1 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString~0.base_3)) (= (store |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 (select (select |v_#memory_$Pointer$.base_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0))) |v_#memory_$Pointer$.base_1|) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 0))) (<= 1 .cse1) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString~0.base_3)))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 193#L37-1 [191] L37-1-->L5: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#in~dst.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_3) (< |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 0) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1|)) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 8)) (< |v_ULTIMATE.start_cstpncpy_~#dst.base_1| |v_#StackHeapBarrier_2|) (= |v_ULTIMATE.start_cstpncpy_#in~dst.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_3) (= |v_ULTIMATE.start_cstpncpy_#in~n_1| v_ULTIMATE.start_main_~n~0_8) (= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_1|) (= |v_ULTIMATE.start_cstpncpy_#in~src.offset_1| v_ULTIMATE.start_main_~nondetString~0.offset_5) (= (store |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 1) |v_#valid_8|) (= |v_ULTIMATE.start_cstpncpy_#in~src.base_1| v_ULTIMATE.start_main_~nondetString~0.base_6)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, #valid=|v_#valid_9|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, #length=|v_#length_7|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_1, ULTIMATE.start_cstpncpy_#t~mem8.base=|v_ULTIMATE.start_cstpncpy_#t~mem8.base_1|, ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_1|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_1|, ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_1|, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_1|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_1|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_1, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_1|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_1, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_1, ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_1|, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_1|, ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_1|, #length=|v_#length_6|, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_1|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_1|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_1, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_1|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_1|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_1|, ULTIMATE.start_cstpncpy_#res.base=|v_ULTIMATE.start_cstpncpy_#res.base_1|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_1|, ULTIMATE.start_cstpncpy_#res.offset=|v_ULTIMATE.start_cstpncpy_#res.offset_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem8.offset=|v_ULTIMATE.start_cstpncpy_#t~mem8.offset_1|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_1, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, #valid=|v_#valid_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_1|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_1|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_#t~mem8.base, ULTIMATE.start_cstpncpy_#t~post7.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#in~src.offset, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~#dst.offset, ULTIMATE.start_cstpncpy_~src.base, ULTIMATE.start_cstpncpy_#in~dst.base, ULTIMATE.start_cstpncpy_#t~mem5, ULTIMATE.start_cstpncpy_~n, ULTIMATE.start_cstpncpy_~s~0.offset, ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~pre2, #length, ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_#in~n, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_#t~mem1.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#res.base, ULTIMATE.start_cstpncpy_#in~src.base, ULTIMATE.start_cstpncpy_#res.offset, ULTIMATE.start_cstpncpy_~#dst.base, ULTIMATE.start_cstpncpy_#t~mem8.offset, ULTIMATE.start_cstpncpy_~src.offset, ULTIMATE.start_cstpncpy_~d~0.offset, #valid, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#in~dst.offset, ULTIMATE.start_cstpncpy_#t~post7.base] 222#L5 [237] L5-->L8: Formula: (and (= v_ULTIMATE.start_cstpncpy_~src.offset_4 |v_ULTIMATE.start_cstpncpy_#in~src.offset_3|) (= (store |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|)) |v_#memory_$Pointer$.offset_16|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|) (= (store |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.base_3|)) |v_#memory_$Pointer$.base_16|) (= v_ULTIMATE.start_cstpncpy_~src.base_4 |v_ULTIMATE.start_cstpncpy_#in~src.base_3|) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| 8) (select |v_#length_26| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|)) (= v_ULTIMATE.start_cstpncpy_~n_10 |v_ULTIMATE.start_cstpncpy_#in~n_3|) (= 1 (select |v_#valid_35| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|)) (= (store |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| (select (select |v_#memory_int_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|))) |v_#memory_int_14|)) InVars {ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} OutVars{ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_16|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_4, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_10, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_4, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~src.offset, #memory_$Pointer$.base, ULTIMATE.start_cstpncpy_~src.base, #memory_int, ULTIMATE.start_cstpncpy_~n, #memory_$Pointer$.offset] 221#L8 [196] L8-->L9: Formula: (> v_ULTIMATE.start_cstpncpy_~n_3 0) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} OutVars{ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} AuxVars[] AssignedVars[] 220#L9 [239] L9-->L12: Formula: (and (= (select |v_#valid_38| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) 1) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_20| 8) (select |v_#length_28| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|)) (= (select (select |v_#memory_$Pointer$.base_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) v_ULTIMATE.start_cstpncpy_~d~0.base_8) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_8 (select (select |v_#memory_$Pointer$.offset_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|)) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) (= v_ULTIMATE.start_cstpncpy_~src.offset_5 v_ULTIMATE.start_cstpncpy_~s~0.offset_5) (= v_ULTIMATE.start_cstpncpy_~src.base_5 v_ULTIMATE.start_cstpncpy_~s~0.base_5)) InVars {ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_8, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_5, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_8, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_5|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_5, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 219#L12 [141] L12-->L12-1: Formula: (and (= (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|) (= (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) (= (select |v_#valid_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) 1) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_7| 8) (select |v_#length_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem1.offset] 218#L12-1 [243] L12-1-->L13-4: Formula: (and (= (store |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (select (select |v_#memory_int_16| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|))) |v_#memory_int_16|) (= |v_#memory_$Pointer$.offset_23| (store |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (+ (mod v_ULTIMATE.start_cstpncpy_~n_11 4294967296) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|)))) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| 8) (select |v_#length_32| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (= (store |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| |v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|)) |v_#memory_$Pointer$.base_23|) (= 1 (select |v_#valid_46| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|)) InVars {ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_24|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_24|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_23|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_16|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_23|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset, ULTIMATE.start_cstpncpy_#t~mem1.offset] 216#L13-4 362.28/278.92 [2019-03-28 12:41:54,836 INFO L796 eck$LassoCheckResult]: Loop: 216#L13-4 [134] L13-4-->L14: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| v_ULTIMATE.start_cstpncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| v_ULTIMATE.start_cstpncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| 1)) (= |v_ULTIMATE.start_cstpncpy_#t~post3.base_2| v_ULTIMATE.start_cstpncpy_~d~0.base_4) (= v_ULTIMATE.start_cstpncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| 1)) (= v_ULTIMATE.start_cstpncpy_~s~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post4.base_2|) (= v_ULTIMATE.start_cstpncpy_~d~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post3.base_2|) (= |v_ULTIMATE.start_cstpncpy_#t~post4.base_2| v_ULTIMATE.start_cstpncpy_~s~0.base_4)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_4, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_4, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_4, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_4} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_3, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_2|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_2|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_2|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_2|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_3, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 217#L14 [111] L14-->L14-1: Formula: (and (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) (= (select |v_#valid_18| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) 1) (= (select (select |v_#memory_int_7| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) |v_ULTIMATE.start_cstpncpy_#t~mem5_2|) (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_16|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_2|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem5] 212#L14-1 [107] L14-1-->L14-2: Formula: (and (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| 1) (select |v_#length_18| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (= (store |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.base_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.base_9|) (= (store |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.offset_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.offset_9|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|) (= |v_#memory_int_8| (store |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| |v_ULTIMATE.start_cstpncpy_#t~mem5_3|)))) InVars {ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_10|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_10|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_9|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 213#L14-2 [222] L14-2-->L13-1: Formula: (< 0 |v_ULTIMATE.start_cstpncpy_#t~mem5_7|) InVars {ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_7|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_6|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_6|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_6|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_7|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#t~mem5] 210#L13-1 [153] L13-1-->L13-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstpncpy_~n_8 (- 1)))) (and (= |v_ULTIMATE.start_cstpncpy_#t~pre2_2| .cse0) (= v_ULTIMATE.start_cstpncpy_~n_7 .cse0))) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_8} OutVars{ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_2|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre2, ULTIMATE.start_cstpncpy_~n] 211#L13-2 [228] L13-2-->L13-4: Formula: (< 0 |v_ULTIMATE.start_cstpncpy_#t~pre2_6|) InVars {ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_6|} OutVars{ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre2] 216#L13-4 362.28/278.92 [2019-03-28 12:41:54,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.92 [2019-03-28 12:41:54,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1771290521, now seen corresponding path program 1 times 362.28/278.92 [2019-03-28 12:41:54,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.92 [2019-03-28 12:41:54,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.92 [2019-03-28 12:41:54,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.92 [2019-03-28 12:41:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.92 [2019-03-28 12:41:54,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.92 [2019-03-28 12:41:54,857 INFO L82 PathProgramCache]: Analyzing trace with hash 534759400, now seen corresponding path program 3 times 362.28/278.92 [2019-03-28 12:41:54,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.92 [2019-03-28 12:41:54,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.92 [2019-03-28 12:41:54,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.92 [2019-03-28 12:41:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.92 [2019-03-28 12:41:54,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.92 [2019-03-28 12:41:54,864 INFO L82 PathProgramCache]: Analyzing trace with hash -673733682, now seen corresponding path program 1 times 362.28/278.92 [2019-03-28 12:41:54,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.92 [2019-03-28 12:41:54,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.92 [2019-03-28 12:41:54,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.92 [2019-03-28 12:41:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.92 [2019-03-28 12:41:56,767 WARN L188 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 164 DAG size of output: 152 362.28/278.92 [2019-03-28 12:41:56,780 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 362.28/278.92 [2019-03-28 12:41:57,079 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 122 362.28/278.92 [2019-03-28 12:41:57,079 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.28/278.92 [2019-03-28 12:41:57,086 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.28/278.92 [2019-03-28 12:41:57,373 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 119 362.28/278.92 [2019-03-28 12:41:57,374 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.28/278.92 [2019-03-28 12:41:57,380 INFO L427 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.28/278.92 [2019-03-28 12:41:57,684 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 116 362.28/278.92 [2019-03-28 12:41:57,684 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.28/278.92 [2019-03-28 12:41:57,685 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 362.28/278.92 [2019-03-28 12:41:57,685 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:270, output treesize:257 362.28/278.92 [2019-03-28 12:41:58,020 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 116 362.28/278.92 [2019-03-28 12:41:58,033 INFO L216 LassoAnalysis]: Preferences: 362.28/278.92 [2019-03-28 12:41:58,034 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 362.28/278.92 [2019-03-28 12:41:58,034 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 362.28/278.92 [2019-03-28 12:41:58,034 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 362.28/278.92 [2019-03-28 12:41:58,034 INFO L127 ssoRankerPreferences]: Use exernal solver: false 362.28/278.92 [2019-03-28 12:41:58,035 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 362.28/278.92 [2019-03-28 12:41:58,035 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 362.28/278.92 [2019-03-28 12:41:58,035 INFO L130 ssoRankerPreferences]: Path of dumped script: 362.28/278.92 [2019-03-28 12:41:58,035 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 362.28/278.92 [2019-03-28 12:41:58,035 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 362.28/278.92 [2019-03-28 12:41:58,035 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 362.28/278.92 [2019-03-28 12:41:58,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,555 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 362.28/278.92 [2019-03-28 12:41:58,715 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 362.28/278.92 [2019-03-28 12:41:58,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:58,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.92 [2019-03-28 12:41:59,012 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 67 362.28/278.92 [2019-03-28 12:41:59,316 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 67 362.28/278.92 [2019-03-28 12:41:59,392 INFO L300 LassoAnalysis]: Preprocessing complete. 362.28/278.92 [2019-03-28 12:41:59,397 INFO L497 LassoAnalysis]: Using template 'affine'. 362.28/278.92 [2019-03-28 12:41:59,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.92 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.92 Number of strict supporting invariants: 0 362.28/278.92 Number of non-strict supporting invariants: 1 362.28/278.92 Consider only non-deceasing supporting invariants: true 362.28/278.92 Simplify termination arguments: true 362.28/278.92 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.92 [2019-03-28 12:41:59,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.92 [2019-03-28 12:41:59,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.92 [2019-03-28 12:41:59,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.92 [2019-03-28 12:41:59,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.92 [2019-03-28 12:41:59,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.92 [2019-03-28 12:41:59,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.92 [2019-03-28 12:41:59,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.92 [2019-03-28 12:41:59,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.92 [2019-03-28 12:41:59,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.92 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.92 Number of strict supporting invariants: 0 362.28/278.92 Number of non-strict supporting invariants: 1 362.28/278.92 Consider only non-deceasing supporting invariants: true 362.28/278.92 Simplify termination arguments: true 362.28/278.92 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.92 [2019-03-28 12:41:59,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.92 [2019-03-28 12:41:59,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.92 [2019-03-28 12:41:59,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.92 [2019-03-28 12:41:59,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.92 [2019-03-28 12:41:59,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.92 [2019-03-28 12:41:59,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.92 [2019-03-28 12:41:59,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.92 [2019-03-28 12:41:59,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.92 [2019-03-28 12:41:59,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.92 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.92 Number of strict supporting invariants: 0 362.28/278.92 Number of non-strict supporting invariants: 1 362.28/278.92 Consider only non-deceasing supporting invariants: true 362.28/278.92 Simplify termination arguments: true 362.28/278.92 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.92 [2019-03-28 12:41:59,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.92 [2019-03-28 12:41:59,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.92 [2019-03-28 12:41:59,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.92 [2019-03-28 12:41:59,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.92 [2019-03-28 12:41:59,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.92 [2019-03-28 12:41:59,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.92 [2019-03-28 12:41:59,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.92 [2019-03-28 12:41:59,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.92 [2019-03-28 12:41:59,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.92 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.92 Number of strict supporting invariants: 0 362.28/278.92 Number of non-strict supporting invariants: 1 362.28/278.92 Consider only non-deceasing supporting invariants: true 362.28/278.92 Simplify termination arguments: true 362.28/278.92 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.92 [2019-03-28 12:41:59,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.92 [2019-03-28 12:41:59,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.92 [2019-03-28 12:41:59,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.92 [2019-03-28 12:41:59,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.92 [2019-03-28 12:41:59,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.92 [2019-03-28 12:41:59,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.92 [2019-03-28 12:41:59,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.92 [2019-03-28 12:41:59,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.92 [2019-03-28 12:41:59,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.92 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.92 Number of strict supporting invariants: 0 362.28/278.92 Number of non-strict supporting invariants: 1 362.28/278.92 Consider only non-deceasing supporting invariants: true 362.28/278.92 Simplify termination arguments: true 362.28/278.92 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.92 [2019-03-28 12:41:59,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.92 [2019-03-28 12:41:59,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.92 [2019-03-28 12:41:59,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.92 [2019-03-28 12:41:59,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.92 [2019-03-28 12:41:59,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 362.28/278.92 [2019-03-28 12:41:59,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 362.28/278.92 [2019-03-28 12:41:59,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.92 [2019-03-28 12:41:59,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.92 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.92 Number of strict supporting invariants: 0 362.28/278.92 Number of non-strict supporting invariants: 1 362.28/278.92 Consider only non-deceasing supporting invariants: true 362.28/278.92 Simplify termination arguments: true 362.28/278.92 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.92 [2019-03-28 12:41:59,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.92 [2019-03-28 12:41:59,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.92 [2019-03-28 12:41:59,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.92 [2019-03-28 12:41:59,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.92 [2019-03-28 12:41:59,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 362.28/278.92 [2019-03-28 12:41:59,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 362.28/278.92 [2019-03-28 12:41:59,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.92 [2019-03-28 12:41:59,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.92 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.92 Number of strict supporting invariants: 0 362.28/278.92 Number of non-strict supporting invariants: 1 362.28/278.92 Consider only non-deceasing supporting invariants: true 362.28/278.92 Simplify termination arguments: true 362.28/278.92 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.92 [2019-03-28 12:41:59,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.92 [2019-03-28 12:41:59,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.92 [2019-03-28 12:41:59,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.92 [2019-03-28 12:41:59,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.92 [2019-03-28 12:41:59,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.92 [2019-03-28 12:41:59,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.92 [2019-03-28 12:41:59,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.92 [2019-03-28 12:41:59,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.92 [2019-03-28 12:41:59,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.92 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.92 Number of strict supporting invariants: 0 362.28/278.92 Number of non-strict supporting invariants: 1 362.28/278.92 Consider only non-deceasing supporting invariants: true 362.28/278.92 Simplify termination arguments: true 362.28/278.92 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.92 [2019-03-28 12:41:59,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.92 [2019-03-28 12:41:59,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.92 [2019-03-28 12:41:59,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.92 [2019-03-28 12:41:59,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.92 [2019-03-28 12:41:59,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 362.28/278.92 [2019-03-28 12:41:59,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 362.28/278.92 [2019-03-28 12:41:59,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.92 [2019-03-28 12:41:59,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.92 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.92 Number of strict supporting invariants: 0 362.28/278.92 Number of non-strict supporting invariants: 1 362.28/278.92 Consider only non-deceasing supporting invariants: true 362.28/278.92 Simplify termination arguments: true 362.28/278.92 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.92 [2019-03-28 12:41:59,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.92 [2019-03-28 12:41:59,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.92 [2019-03-28 12:41:59,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.92 [2019-03-28 12:41:59,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.92 [2019-03-28 12:41:59,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 362.28/278.92 [2019-03-28 12:41:59,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 362.28/278.92 [2019-03-28 12:41:59,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.92 [2019-03-28 12:41:59,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.92 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.92 Number of strict supporting invariants: 0 362.28/278.92 Number of non-strict supporting invariants: 1 362.28/278.92 Consider only non-deceasing supporting invariants: true 362.28/278.92 Simplify termination arguments: true 362.28/278.92 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.92 [2019-03-28 12:41:59,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.92 [2019-03-28 12:41:59,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.92 [2019-03-28 12:41:59,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.92 [2019-03-28 12:41:59,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.92 [2019-03-28 12:41:59,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 362.28/278.92 [2019-03-28 12:41:59,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 362.28/278.92 [2019-03-28 12:41:59,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.92 [2019-03-28 12:41:59,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.92 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.92 Number of strict supporting invariants: 0 362.28/278.92 Number of non-strict supporting invariants: 1 362.28/278.92 Consider only non-deceasing supporting invariants: true 362.28/278.92 Simplify termination arguments: true 362.28/278.92 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.92 [2019-03-28 12:41:59,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.92 [2019-03-28 12:41:59,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.92 [2019-03-28 12:41:59,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.92 [2019-03-28 12:41:59,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.92 [2019-03-28 12:41:59,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 362.28/278.92 [2019-03-28 12:41:59,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 362.28/278.92 [2019-03-28 12:41:59,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.92 [2019-03-28 12:41:59,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.92 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.92 Number of strict supporting invariants: 0 362.28/278.92 Number of non-strict supporting invariants: 1 362.28/278.92 Consider only non-deceasing supporting invariants: true 362.28/278.92 Simplify termination arguments: true 362.28/278.92 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.92 [2019-03-28 12:41:59,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.92 [2019-03-28 12:41:59,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.92 [2019-03-28 12:41:59,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.92 [2019-03-28 12:41:59,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.92 [2019-03-28 12:41:59,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.92 [2019-03-28 12:41:59,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.92 [2019-03-28 12:41:59,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.92 [2019-03-28 12:41:59,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.92 [2019-03-28 12:41:59,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.92 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.92 Number of strict supporting invariants: 0 362.28/278.92 Number of non-strict supporting invariants: 1 362.28/278.92 Consider only non-deceasing supporting invariants: true 362.28/278.92 Simplify termination arguments: true 362.28/278.92 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.92 [2019-03-28 12:41:59,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.92 [2019-03-28 12:41:59,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.92 [2019-03-28 12:41:59,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.92 [2019-03-28 12:41:59,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.92 [2019-03-28 12:41:59,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 362.28/278.92 [2019-03-28 12:41:59,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 362.28/278.92 [2019-03-28 12:41:59,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.92 [2019-03-28 12:41:59,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.92 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.92 Number of strict supporting invariants: 0 362.28/278.92 Number of non-strict supporting invariants: 1 362.28/278.92 Consider only non-deceasing supporting invariants: true 362.28/278.92 Simplify termination arguments: true 362.28/278.92 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.92 [2019-03-28 12:41:59,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.92 [2019-03-28 12:41:59,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.92 [2019-03-28 12:41:59,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.92 [2019-03-28 12:41:59,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.92 [2019-03-28 12:41:59,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 362.28/278.92 [2019-03-28 12:41:59,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 362.28/278.92 [2019-03-28 12:41:59,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.92 [2019-03-28 12:41:59,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.92 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.92 Number of strict supporting invariants: 0 362.28/278.92 Number of non-strict supporting invariants: 1 362.28/278.92 Consider only non-deceasing supporting invariants: true 362.28/278.92 Simplify termination arguments: true 362.28/278.92 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.92 [2019-03-28 12:41:59,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.92 [2019-03-28 12:41:59,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.92 [2019-03-28 12:41:59,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.92 [2019-03-28 12:41:59,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.92 [2019-03-28 12:41:59,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.92 [2019-03-28 12:41:59,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.92 [2019-03-28 12:41:59,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.92 [2019-03-28 12:41:59,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.92 [2019-03-28 12:41:59,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.92 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.92 Number of strict supporting invariants: 0 362.28/278.92 Number of non-strict supporting invariants: 1 362.28/278.92 Consider only non-deceasing supporting invariants: true 362.28/278.92 Simplify termination arguments: true 362.28/278.92 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.92 [2019-03-28 12:41:59,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.92 [2019-03-28 12:41:59,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.92 [2019-03-28 12:41:59,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.92 [2019-03-28 12:41:59,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.92 [2019-03-28 12:41:59,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.92 [2019-03-28 12:41:59,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.92 [2019-03-28 12:41:59,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.92 [2019-03-28 12:41:59,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.92 [2019-03-28 12:41:59,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.92 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.92 Number of strict supporting invariants: 0 362.28/278.92 Number of non-strict supporting invariants: 1 362.28/278.92 Consider only non-deceasing supporting invariants: true 362.28/278.92 Simplify termination arguments: true 362.28/278.92 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.92 [2019-03-28 12:41:59,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.92 [2019-03-28 12:41:59,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.92 [2019-03-28 12:41:59,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.92 [2019-03-28 12:41:59,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.92 [2019-03-28 12:41:59,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 362.28/278.92 [2019-03-28 12:41:59,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 362.28/278.92 [2019-03-28 12:41:59,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.92 [2019-03-28 12:41:59,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.92 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.92 Number of strict supporting invariants: 0 362.28/278.92 Number of non-strict supporting invariants: 1 362.28/278.92 Consider only non-deceasing supporting invariants: true 362.28/278.92 Simplify termination arguments: true 362.28/278.92 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.92 [2019-03-28 12:41:59,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.92 [2019-03-28 12:41:59,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.92 [2019-03-28 12:41:59,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.92 [2019-03-28 12:41:59,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.92 [2019-03-28 12:41:59,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 362.28/278.92 [2019-03-28 12:41:59,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 362.28/278.92 [2019-03-28 12:41:59,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.92 [2019-03-28 12:41:59,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.92 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.92 Number of strict supporting invariants: 0 362.28/278.92 Number of non-strict supporting invariants: 1 362.28/278.92 Consider only non-deceasing supporting invariants: true 362.28/278.92 Simplify termination arguments: true 362.28/278.92 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.92 [2019-03-28 12:41:59,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.92 [2019-03-28 12:41:59,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.92 [2019-03-28 12:41:59,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.92 [2019-03-28 12:41:59,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.92 [2019-03-28 12:41:59,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 362.28/278.92 [2019-03-28 12:41:59,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 362.28/278.92 [2019-03-28 12:41:59,550 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 362.28/278.92 [2019-03-28 12:41:59,574 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 362.28/278.92 [2019-03-28 12:41:59,574 INFO L444 ModelExtractionUtils]: 52 out of 58 variables were initially zero. Simplification set additionally 4 variables to zero. 362.28/278.92 [2019-03-28 12:41:59,577 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 362.28/278.92 [2019-03-28 12:41:59,578 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 362.28/278.92 [2019-03-28 12:41:59,578 INFO L518 LassoAnalysis]: Proved termination. 362.28/278.92 [2019-03-28 12:41:59,579 INFO L520 LassoAnalysis]: Termination argument consisting of: 362.28/278.92 Ranking function f(ULTIMATE.start_cstpncpy_~n) = 1*ULTIMATE.start_cstpncpy_~n 362.28/278.92 Supporting invariants [] 362.28/278.92 [2019-03-28 12:41:59,653 INFO L297 tatePredicateManager]: 19 out of 19 supporting invariants were superfluous and have been removed 362.28/278.92 [2019-03-28 12:41:59,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.92 [2019-03-28 12:41:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.28/278.92 [2019-03-28 12:41:59,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core 362.28/278.92 [2019-03-28 12:41:59,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.28/278.92 [2019-03-28 12:41:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.28/278.92 [2019-03-28 12:41:59,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core 362.28/278.92 [2019-03-28 12:41:59,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.28/278.92 [2019-03-28 12:41:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.28/278.92 [2019-03-28 12:41:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.92 [2019-03-28 12:41:59,756 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 362.28/278.92 [2019-03-28 12:41:59,757 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 362.28/278.92 [2019-03-28 12:41:59,761 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 362.28/278.92 [2019-03-28 12:41:59,761 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 35 states and 51 transitions. cyclomatic complexity: 19 Second operand 4 states. 362.28/278.92 [2019-03-28 12:41:59,862 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 35 states and 51 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 74 states and 106 transitions. Complement of second has 8 states. 362.28/278.92 [2019-03-28 12:41:59,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 362.28/278.92 [2019-03-28 12:41:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 362.28/278.92 [2019-03-28 12:41:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. 362.28/278.92 [2019-03-28 12:41:59,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 11 letters. Loop has 6 letters. 362.28/278.92 [2019-03-28 12:41:59,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. 362.28/278.92 [2019-03-28 12:41:59,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 17 letters. Loop has 6 letters. 362.28/278.92 [2019-03-28 12:41:59,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. 362.28/278.92 [2019-03-28 12:41:59,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 11 letters. Loop has 12 letters. 362.28/278.92 [2019-03-28 12:41:59,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. 362.28/278.92 [2019-03-28 12:41:59,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 106 transitions. 362.28/278.92 [2019-03-28 12:41:59,875 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 362.28/278.92 [2019-03-28 12:41:59,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 58 states and 82 transitions. 362.28/278.92 [2019-03-28 12:41:59,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 362.28/278.92 [2019-03-28 12:41:59,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 362.28/278.92 [2019-03-28 12:41:59,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 82 transitions. 362.28/278.92 [2019-03-28 12:41:59,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 362.28/278.92 [2019-03-28 12:41:59,877 INFO L706 BuchiCegarLoop]: Abstraction has 58 states and 82 transitions. 362.28/278.92 [2019-03-28 12:41:59,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 82 transitions. 362.28/278.92 [2019-03-28 12:41:59,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. 362.28/278.92 [2019-03-28 12:41:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. 362.28/278.92 [2019-03-28 12:41:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. 362.28/278.92 [2019-03-28 12:41:59,879 INFO L729 BuchiCegarLoop]: Abstraction has 37 states and 54 transitions. 362.28/278.92 [2019-03-28 12:41:59,879 INFO L609 BuchiCegarLoop]: Abstraction has 37 states and 54 transitions. 362.28/278.92 [2019-03-28 12:41:59,879 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 362.28/278.92 [2019-03-28 12:41:59,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 54 transitions. 362.28/278.92 [2019-03-28 12:41:59,880 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 362.28/278.92 [2019-03-28 12:41:59,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 362.28/278.92 [2019-03-28 12:41:59,880 INFO L119 BuchiIsEmpty]: Starting construction of run 362.28/278.92 [2019-03-28 12:41:59,880 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.28/278.92 [2019-03-28 12:41:59,880 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 362.28/278.92 [2019-03-28 12:41:59,881 INFO L794 eck$LassoCheckResult]: Stem: 471#ULTIMATE.startENTRY [236] ULTIMATE.startENTRY-->L29: Formula: (and (= (store |v_#valid_34| 0 0) |v_#valid_33|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_34|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_33|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_#t~ret13.base, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 464#L29 [154] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 460#L29-2 [95] L29-2-->L32-1: Formula: (and (= v_ULTIMATE.start_main_~n~0_4 1) (< v_ULTIMATE.start_main_~n~0_5 1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0] 462#L32-1 [185] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2| 1))) (and (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2| 1)) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2|) 0) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2|)) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (< |v_ULTIMATE.start_main_#t~malloc12.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc12.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_2| v_ULTIMATE.start_main_~length~0_7)))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_#t~malloc11.base, #length] 456#L37 [117] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8 (- 1))) (.cse1 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8))) (and (= |v_#memory_$Pointer$.offset_1| (store |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 (select (select |v_#memory_$Pointer$.offset_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0)))) (<= .cse1 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString~0.base_3)) (= (store |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 (select (select |v_#memory_$Pointer$.base_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0))) |v_#memory_$Pointer$.base_1|) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 0))) (<= 1 .cse1) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString~0.base_3)))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 457#L37-1 [191] L37-1-->L5: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#in~dst.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_3) (< |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 0) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1|)) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 8)) (< |v_ULTIMATE.start_cstpncpy_~#dst.base_1| |v_#StackHeapBarrier_2|) (= |v_ULTIMATE.start_cstpncpy_#in~dst.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_3) (= |v_ULTIMATE.start_cstpncpy_#in~n_1| v_ULTIMATE.start_main_~n~0_8) (= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_1|) (= |v_ULTIMATE.start_cstpncpy_#in~src.offset_1| v_ULTIMATE.start_main_~nondetString~0.offset_5) (= (store |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 1) |v_#valid_8|) (= |v_ULTIMATE.start_cstpncpy_#in~src.base_1| v_ULTIMATE.start_main_~nondetString~0.base_6)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, #valid=|v_#valid_9|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, #length=|v_#length_7|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_1, ULTIMATE.start_cstpncpy_#t~mem8.base=|v_ULTIMATE.start_cstpncpy_#t~mem8.base_1|, ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_1|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_1|, ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_1|, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_1|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_1|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_1, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_1|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_1, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_1, ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_1|, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_1|, ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_1|, #length=|v_#length_6|, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_1|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_1|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_1, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_1|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_1|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_1|, ULTIMATE.start_cstpncpy_#res.base=|v_ULTIMATE.start_cstpncpy_#res.base_1|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_1|, ULTIMATE.start_cstpncpy_#res.offset=|v_ULTIMATE.start_cstpncpy_#res.offset_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem8.offset=|v_ULTIMATE.start_cstpncpy_#t~mem8.offset_1|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_1, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, #valid=|v_#valid_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_1|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_1|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_#t~mem8.base, ULTIMATE.start_cstpncpy_#t~post7.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#in~src.offset, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~#dst.offset, ULTIMATE.start_cstpncpy_~src.base, ULTIMATE.start_cstpncpy_#in~dst.base, ULTIMATE.start_cstpncpy_#t~mem5, ULTIMATE.start_cstpncpy_~n, ULTIMATE.start_cstpncpy_~s~0.offset, ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~pre2, #length, ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_#in~n, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_#t~mem1.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#res.base, ULTIMATE.start_cstpncpy_#in~src.base, ULTIMATE.start_cstpncpy_#res.offset, ULTIMATE.start_cstpncpy_~#dst.base, ULTIMATE.start_cstpncpy_#t~mem8.offset, ULTIMATE.start_cstpncpy_~src.offset, ULTIMATE.start_cstpncpy_~d~0.offset, #valid, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#in~dst.offset, ULTIMATE.start_cstpncpy_#t~post7.base] 488#L5 [237] L5-->L8: Formula: (and (= v_ULTIMATE.start_cstpncpy_~src.offset_4 |v_ULTIMATE.start_cstpncpy_#in~src.offset_3|) (= (store |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|)) |v_#memory_$Pointer$.offset_16|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|) (= (store |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.base_3|)) |v_#memory_$Pointer$.base_16|) (= v_ULTIMATE.start_cstpncpy_~src.base_4 |v_ULTIMATE.start_cstpncpy_#in~src.base_3|) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| 8) (select |v_#length_26| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|)) (= v_ULTIMATE.start_cstpncpy_~n_10 |v_ULTIMATE.start_cstpncpy_#in~n_3|) (= 1 (select |v_#valid_35| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|)) (= (store |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| (select (select |v_#memory_int_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|))) |v_#memory_int_14|)) InVars {ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} OutVars{ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_16|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_4, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_10, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_4, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~src.offset, #memory_$Pointer$.base, ULTIMATE.start_cstpncpy_~src.base, #memory_int, ULTIMATE.start_cstpncpy_~n, #memory_$Pointer$.offset] 487#L8 [196] L8-->L9: Formula: (> v_ULTIMATE.start_cstpncpy_~n_3 0) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} OutVars{ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} AuxVars[] AssignedVars[] 486#L9 [239] L9-->L12: Formula: (and (= (select |v_#valid_38| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) 1) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_20| 8) (select |v_#length_28| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|)) (= (select (select |v_#memory_$Pointer$.base_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) v_ULTIMATE.start_cstpncpy_~d~0.base_8) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_8 (select (select |v_#memory_$Pointer$.offset_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|)) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) (= v_ULTIMATE.start_cstpncpy_~src.offset_5 v_ULTIMATE.start_cstpncpy_~s~0.offset_5) (= v_ULTIMATE.start_cstpncpy_~src.base_5 v_ULTIMATE.start_cstpncpy_~s~0.base_5)) InVars {ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_8, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_5, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_8, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_5|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_5, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 480#L12 [141] L12-->L12-1: Formula: (and (= (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|) (= (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) (= (select |v_#valid_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) 1) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_7| 8) (select |v_#length_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem1.offset] 472#L12-1 [243] L12-1-->L13-4: Formula: (and (= (store |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (select (select |v_#memory_int_16| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|))) |v_#memory_int_16|) (= |v_#memory_$Pointer$.offset_23| (store |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (+ (mod v_ULTIMATE.start_cstpncpy_~n_11 4294967296) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|)))) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| 8) (select |v_#length_32| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (= (store |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| |v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|)) |v_#memory_$Pointer$.base_23|) (= 1 (select |v_#valid_46| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|)) InVars {ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_24|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_24|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_23|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_16|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_23|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset, ULTIMATE.start_cstpncpy_#t~mem1.offset] 466#L13-4 362.28/278.92 [2019-03-28 12:41:59,882 INFO L796 eck$LassoCheckResult]: Loop: 466#L13-4 [134] L13-4-->L14: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| v_ULTIMATE.start_cstpncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| v_ULTIMATE.start_cstpncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| 1)) (= |v_ULTIMATE.start_cstpncpy_#t~post3.base_2| v_ULTIMATE.start_cstpncpy_~d~0.base_4) (= v_ULTIMATE.start_cstpncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| 1)) (= v_ULTIMATE.start_cstpncpy_~s~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post4.base_2|) (= v_ULTIMATE.start_cstpncpy_~d~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post3.base_2|) (= |v_ULTIMATE.start_cstpncpy_#t~post4.base_2| v_ULTIMATE.start_cstpncpy_~s~0.base_4)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_4, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_4, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_4, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_4} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_3, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_2|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_2|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_2|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_2|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_3, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 467#L14 [111] L14-->L14-1: Formula: (and (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) (= (select |v_#valid_18| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) 1) (= (select (select |v_#memory_int_7| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) |v_ULTIMATE.start_cstpncpy_#t~mem5_2|) (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_16|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_2|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem5] 481#L14-1 [107] L14-1-->L14-2: Formula: (and (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| 1) (select |v_#length_18| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (= (store |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.base_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.base_9|) (= (store |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.offset_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.offset_9|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|) (= |v_#memory_int_8| (store |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| |v_ULTIMATE.start_cstpncpy_#t~mem5_3|)))) InVars {ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_10|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_10|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_9|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 476#L14-2 [222] L14-2-->L13-1: Formula: (< 0 |v_ULTIMATE.start_cstpncpy_#t~mem5_7|) InVars {ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_7|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_6|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_6|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_6|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_7|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#t~mem5] 477#L13-1 [153] L13-1-->L13-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstpncpy_~n_8 (- 1)))) (and (= |v_ULTIMATE.start_cstpncpy_#t~pre2_2| .cse0) (= v_ULTIMATE.start_cstpncpy_~n_7 .cse0))) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_8} OutVars{ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_2|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre2, ULTIMATE.start_cstpncpy_~n] 473#L13-2 [229] L13-2-->L13-4: Formula: (> 0 |v_ULTIMATE.start_cstpncpy_#t~pre2_6|) InVars {ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_6|} OutVars{ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre2] 466#L13-4 362.28/278.92 [2019-03-28 12:41:59,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.92 [2019-03-28 12:41:59,882 INFO L82 PathProgramCache]: Analyzing trace with hash -698205141, now seen corresponding path program 2 times 362.28/278.92 [2019-03-28 12:41:59,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.92 [2019-03-28 12:41:59,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.92 [2019-03-28 12:41:59,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:59,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:59,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.92 [2019-03-28 12:41:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.92 [2019-03-28 12:41:59,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.92 [2019-03-28 12:41:59,905 INFO L82 PathProgramCache]: Analyzing trace with hash 534759401, now seen corresponding path program 1 times 362.28/278.92 [2019-03-28 12:41:59,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.92 [2019-03-28 12:41:59,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.92 [2019-03-28 12:41:59,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:59,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:59,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.92 [2019-03-28 12:41:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.92 [2019-03-28 12:41:59,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.92 [2019-03-28 12:41:59,912 INFO L82 PathProgramCache]: Analyzing trace with hash -932529005, now seen corresponding path program 1 times 362.28/278.92 [2019-03-28 12:41:59,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.92 [2019-03-28 12:41:59,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.92 [2019-03-28 12:41:59,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:59,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.92 [2019-03-28 12:41:59,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:41:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.28/278.93 [2019-03-28 12:41:59,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.28/278.93 [2019-03-28 12:41:59,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.28/278.93 [2019-03-28 12:41:59,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 362.28/278.93 [2019-03-28 12:42:00,044 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 72 362.28/278.93 [2019-03-28 12:42:00,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 362.28/278.93 [2019-03-28 12:42:00,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 362.28/278.93 [2019-03-28 12:42:00,105 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. cyclomatic complexity: 20 Second operand 4 states. 362.28/278.93 [2019-03-28 12:42:00,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.28/278.93 [2019-03-28 12:42:00,168 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. 362.28/278.93 [2019-03-28 12:42:00,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 362.28/278.93 [2019-03-28 12:42:00,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 69 transitions. 362.28/278.93 [2019-03-28 12:42:00,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 362.28/278.93 [2019-03-28 12:42:00,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 48 states and 66 transitions. 362.28/278.93 [2019-03-28 12:42:00,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 362.28/278.93 [2019-03-28 12:42:00,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 362.28/278.93 [2019-03-28 12:42:00,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 66 transitions. 362.28/278.93 [2019-03-28 12:42:00,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 362.28/278.93 [2019-03-28 12:42:00,174 INFO L706 BuchiCegarLoop]: Abstraction has 48 states and 66 transitions. 362.28/278.93 [2019-03-28 12:42:00,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 66 transitions. 362.28/278.93 [2019-03-28 12:42:00,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. 362.28/278.93 [2019-03-28 12:42:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. 362.28/278.93 [2019-03-28 12:42:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. 362.28/278.93 [2019-03-28 12:42:00,176 INFO L729 BuchiCegarLoop]: Abstraction has 46 states and 64 transitions. 362.28/278.93 [2019-03-28 12:42:00,176 INFO L609 BuchiCegarLoop]: Abstraction has 46 states and 64 transitions. 362.28/278.93 [2019-03-28 12:42:00,176 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 362.28/278.93 [2019-03-28 12:42:00,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 64 transitions. 362.28/278.93 [2019-03-28 12:42:00,177 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 362.28/278.93 [2019-03-28 12:42:00,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 362.28/278.93 [2019-03-28 12:42:00,177 INFO L119 BuchiIsEmpty]: Starting construction of run 362.28/278.93 [2019-03-28 12:42:00,178 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.28/278.93 [2019-03-28 12:42:00,178 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 362.28/278.93 [2019-03-28 12:42:00,179 INFO L794 eck$LassoCheckResult]: Stem: 567#ULTIMATE.startENTRY [236] ULTIMATE.startENTRY-->L29: Formula: (and (= (store |v_#valid_34| 0 0) |v_#valid_33|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_34|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_33|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_#t~ret13.base, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 560#L29 [154] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 556#L29-2 [155] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 557#L32-1 [185] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2| 1))) (and (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2| 1)) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2|) 0) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2|)) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (< |v_ULTIMATE.start_main_#t~malloc12.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc12.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_2| v_ULTIMATE.start_main_~length~0_7)))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_#t~malloc11.base, #length] 552#L37 [117] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8 (- 1))) (.cse1 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8))) (and (= |v_#memory_$Pointer$.offset_1| (store |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 (select (select |v_#memory_$Pointer$.offset_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0)))) (<= .cse1 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString~0.base_3)) (= (store |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 (select (select |v_#memory_$Pointer$.base_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0))) |v_#memory_$Pointer$.base_1|) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 0))) (<= 1 .cse1) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString~0.base_3)))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 553#L37-1 [191] L37-1-->L5: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#in~dst.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_3) (< |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 0) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1|)) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 8)) (< |v_ULTIMATE.start_cstpncpy_~#dst.base_1| |v_#StackHeapBarrier_2|) (= |v_ULTIMATE.start_cstpncpy_#in~dst.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_3) (= |v_ULTIMATE.start_cstpncpy_#in~n_1| v_ULTIMATE.start_main_~n~0_8) (= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_1|) (= |v_ULTIMATE.start_cstpncpy_#in~src.offset_1| v_ULTIMATE.start_main_~nondetString~0.offset_5) (= (store |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 1) |v_#valid_8|) (= |v_ULTIMATE.start_cstpncpy_#in~src.base_1| v_ULTIMATE.start_main_~nondetString~0.base_6)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, #valid=|v_#valid_9|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, #length=|v_#length_7|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_1, ULTIMATE.start_cstpncpy_#t~mem8.base=|v_ULTIMATE.start_cstpncpy_#t~mem8.base_1|, ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_1|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_1|, ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_1|, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_1|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_1|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_1, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_1|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_1, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_1, ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_1|, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_1|, ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_1|, #length=|v_#length_6|, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_1|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_1|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_1, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_1|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_1|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_1|, ULTIMATE.start_cstpncpy_#res.base=|v_ULTIMATE.start_cstpncpy_#res.base_1|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_1|, ULTIMATE.start_cstpncpy_#res.offset=|v_ULTIMATE.start_cstpncpy_#res.offset_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem8.offset=|v_ULTIMATE.start_cstpncpy_#t~mem8.offset_1|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_1, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, #valid=|v_#valid_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_1|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_1|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_#t~mem8.base, ULTIMATE.start_cstpncpy_#t~post7.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#in~src.offset, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~#dst.offset, ULTIMATE.start_cstpncpy_~src.base, ULTIMATE.start_cstpncpy_#in~dst.base, ULTIMATE.start_cstpncpy_#t~mem5, ULTIMATE.start_cstpncpy_~n, ULTIMATE.start_cstpncpy_~s~0.offset, ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~pre2, #length, ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_#in~n, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_#t~mem1.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#res.base, ULTIMATE.start_cstpncpy_#in~src.base, ULTIMATE.start_cstpncpy_#res.offset, ULTIMATE.start_cstpncpy_~#dst.base, ULTIMATE.start_cstpncpy_#t~mem8.offset, ULTIMATE.start_cstpncpy_~src.offset, ULTIMATE.start_cstpncpy_~d~0.offset, #valid, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#in~dst.offset, ULTIMATE.start_cstpncpy_#t~post7.base] 554#L5 [237] L5-->L8: Formula: (and (= v_ULTIMATE.start_cstpncpy_~src.offset_4 |v_ULTIMATE.start_cstpncpy_#in~src.offset_3|) (= (store |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|)) |v_#memory_$Pointer$.offset_16|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|) (= (store |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.base_3|)) |v_#memory_$Pointer$.base_16|) (= v_ULTIMATE.start_cstpncpy_~src.base_4 |v_ULTIMATE.start_cstpncpy_#in~src.base_3|) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| 8) (select |v_#length_26| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|)) (= v_ULTIMATE.start_cstpncpy_~n_10 |v_ULTIMATE.start_cstpncpy_#in~n_3|) (= 1 (select |v_#valid_35| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|)) (= (store |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| (select (select |v_#memory_int_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|))) |v_#memory_int_14|)) InVars {ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} OutVars{ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_16|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_4, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_10, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_4, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~src.offset, #memory_$Pointer$.base, ULTIMATE.start_cstpncpy_~src.base, #memory_int, ULTIMATE.start_cstpncpy_~n, #memory_$Pointer$.offset] 555#L8 [196] L8-->L9: Formula: (> v_ULTIMATE.start_cstpncpy_~n_3 0) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} OutVars{ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} AuxVars[] AssignedVars[] 561#L9 [239] L9-->L12: Formula: (and (= (select |v_#valid_38| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) 1) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_20| 8) (select |v_#length_28| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|)) (= (select (select |v_#memory_$Pointer$.base_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) v_ULTIMATE.start_cstpncpy_~d~0.base_8) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_8 (select (select |v_#memory_$Pointer$.offset_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|)) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) (= v_ULTIMATE.start_cstpncpy_~src.offset_5 v_ULTIMATE.start_cstpncpy_~s~0.offset_5) (= v_ULTIMATE.start_cstpncpy_~src.base_5 v_ULTIMATE.start_cstpncpy_~s~0.base_5)) InVars {ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_8, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_5, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_8, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_5|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_5, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 562#L12 [141] L12-->L12-1: Formula: (and (= (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|) (= (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) (= (select |v_#valid_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) 1) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_7| 8) (select |v_#length_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem1.offset] 573#L12-1 [243] L12-1-->L13-4: Formula: (and (= (store |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (select (select |v_#memory_int_16| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|))) |v_#memory_int_16|) (= |v_#memory_$Pointer$.offset_23| (store |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (+ (mod v_ULTIMATE.start_cstpncpy_~n_11 4294967296) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|)))) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| 8) (select |v_#length_32| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (= (store |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| |v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|)) |v_#memory_$Pointer$.base_23|) (= 1 (select |v_#valid_46| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|)) InVars {ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_24|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_24|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_23|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_16|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_23|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset, ULTIMATE.start_cstpncpy_#t~mem1.offset] 588#L13-4 [134] L13-4-->L14: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| v_ULTIMATE.start_cstpncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| v_ULTIMATE.start_cstpncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| 1)) (= |v_ULTIMATE.start_cstpncpy_#t~post3.base_2| v_ULTIMATE.start_cstpncpy_~d~0.base_4) (= v_ULTIMATE.start_cstpncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| 1)) (= v_ULTIMATE.start_cstpncpy_~s~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post4.base_2|) (= v_ULTIMATE.start_cstpncpy_~d~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post3.base_2|) (= |v_ULTIMATE.start_cstpncpy_#t~post4.base_2| v_ULTIMATE.start_cstpncpy_~s~0.base_4)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_4, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_4, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_4, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_4} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_3, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_2|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_2|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_2|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_2|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_3, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 583#L14 [111] L14-->L14-1: Formula: (and (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) (= (select |v_#valid_18| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) 1) (= (select (select |v_#memory_int_7| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) |v_ULTIMATE.start_cstpncpy_#t~mem5_2|) (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_16|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_2|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem5] 580#L14-1 [107] L14-1-->L14-2: Formula: (and (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| 1) (select |v_#length_18| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (= (store |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.base_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.base_9|) (= (store |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.offset_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.offset_9|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|) (= |v_#memory_int_8| (store |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| |v_ULTIMATE.start_cstpncpy_#t~mem5_3|)))) InVars {ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_10|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_10|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_9|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 574#L14-2 [105] L14-2-->L15: Formula: (= 0 |v_ULTIMATE.start_cstpncpy_#t~mem5_5|) InVars {ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_5|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_5|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_4|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_6|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_6|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#t~mem5] 549#L15 [114] L15-->L17-2: Formula: (and (= 1 (select |v_#valid_22| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|)) (= |v_#memory_$Pointer$.base_11| (store |v_#memory_$Pointer$.base_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_15| (store (select |v_#memory_$Pointer$.base_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_11| v_ULTIMATE.start_cstpncpy_~d~0.base_5))) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_11|) (= (store |v_#memory_$Pointer$.offset_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_15| (store (select |v_#memory_$Pointer$.offset_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_11| (+ v_ULTIMATE.start_cstpncpy_~d~0.offset_5 (- 1)))) |v_#memory_$Pointer$.offset_11|) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_11| 8) (select |v_#length_20| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|)) (= (store |v_#memory_int_11| |v_ULTIMATE.start_cstpncpy_~#dst.base_15| (store (select |v_#memory_int_11| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_11| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_11|))) |v_#memory_int_10|)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_5, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_5, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_12|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_11|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_15|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_12|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_5, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_5, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_11|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_11|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_20|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_15|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_11|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 550#L17-2 362.28/278.93 [2019-03-28 12:42:00,179 INFO L796 eck$LassoCheckResult]: Loop: 550#L17-2 [147] L17-2-->L17: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstpncpy_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstpncpy_~n_5 .cse0) (= |v_ULTIMATE.start_cstpncpy_#t~pre6_2| .cse0))) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_6} OutVars{ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_2|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_~n] 551#L17 [230] L17-->L18: Formula: (and (= v_ULTIMATE.start_cstpncpy_~d~0.offset_6 (+ |v_ULTIMATE.start_cstpncpy_#t~post7.offset_2| 1)) (< 0 |v_ULTIMATE.start_cstpncpy_#t~pre6_6|) (= |v_ULTIMATE.start_cstpncpy_#t~post7.base_2| v_ULTIMATE.start_cstpncpy_~d~0.base_7) (= v_ULTIMATE.start_cstpncpy_~d~0.base_6 |v_ULTIMATE.start_cstpncpy_#t~post7.base_2|) (= |v_ULTIMATE.start_cstpncpy_#t~post7.offset_2| v_ULTIMATE.start_cstpncpy_~d~0.offset_7)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_7, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_7, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_6|} OutVars{ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_6, ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_6, ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_2|, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_5|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_#t~post7.offset, ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_#t~post7.base] 559#L18 [244] L18-->L17-2: Formula: (and (= (store |v_#memory_$Pointer$.base_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8| (store (select |v_#memory_$Pointer$.base_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| (select (select |v_#memory_$Pointer$.base_25| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|))) |v_#memory_$Pointer$.base_25|) (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| 1) (select |v_#length_33| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|)) (= (store |v_#memory_$Pointer$.offset_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8| (store (select |v_#memory_$Pointer$.offset_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| (select (select |v_#memory_$Pointer$.offset_25| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|))) |v_#memory_$Pointer$.offset_25|) (= (store |v_#memory_int_19| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8| (store (select |v_#memory_int_19| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| 0)) |v_#memory_int_18|) (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|) (= 1 (select |v_#valid_47| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|))) InVars {ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_26|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_19|, #length=|v_#length_33|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_8|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_26|} OutVars{ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_6|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_25|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_33|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_7|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_25|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~post7.offset, #memory_$Pointer$.base, #memory_int, ULTIMATE.start_cstpncpy_#t~post7.base, #memory_$Pointer$.offset] 550#L17-2 362.28/278.93 [2019-03-28 12:42:00,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.93 [2019-03-28 12:42:00,180 INFO L82 PathProgramCache]: Analyzing trace with hash 2056472964, now seen corresponding path program 1 times 362.28/278.93 [2019-03-28 12:42:00,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.93 [2019-03-28 12:42:00,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.93 [2019-03-28 12:42:00,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:00,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:00,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:00,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.93 [2019-03-28 12:42:00,209 INFO L82 PathProgramCache]: Analyzing trace with hash 178432, now seen corresponding path program 1 times 362.28/278.93 [2019-03-28 12:42:00,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.93 [2019-03-28 12:42:00,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.93 [2019-03-28 12:42:00,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:00,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:00,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:00,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.93 [2019-03-28 12:42:00,216 INFO L82 PathProgramCache]: Analyzing trace with hash 972709021, now seen corresponding path program 1 times 362.28/278.93 [2019-03-28 12:42:00,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.93 [2019-03-28 12:42:00,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.93 [2019-03-28 12:42:00,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:00,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:00,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:07,798 WARN L188 SmtUtils]: Spent 7.47 s on a formula simplification. DAG size of input: 234 DAG size of output: 212 362.28/278.93 [2019-03-28 12:42:07,804 INFO L388 ElimStorePlain]: Different consts {2=[|v_#memory_$Pointer$.base_90|, |v_#memory_int_97|, |v_#memory_$Pointer$.offset_86|], 4=[|v_#memory_$Pointer$.base_93|, |v_#memory_$Pointer$.offset_89|], 10=[|v_#memory_int_96|]} 362.28/278.93 [2019-03-28 12:42:07,819 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.28/278.93 [2019-03-28 12:42:09,210 WARN L188 SmtUtils]: Spent 1.39 s on a formula simplification that was a NOOP. DAG size: 161 362.28/278.93 [2019-03-28 12:42:09,211 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.28/278.93 [2019-03-28 12:42:09,224 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 362.28/278.93 [2019-03-28 12:42:10,328 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 155 362.28/278.93 [2019-03-28 12:42:10,328 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.28/278.93 [2019-03-28 12:42:10,338 INFO L427 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.28/278.93 [2019-03-28 12:42:11,506 WARN L188 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 152 362.28/278.93 [2019-03-28 12:42:11,507 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.28/278.93 [2019-03-28 12:42:11,516 INFO L427 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.28/278.93 [2019-03-28 12:42:12,977 WARN L188 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 149 362.28/278.93 [2019-03-28 12:42:12,978 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.28/278.93 [2019-03-28 12:42:12,987 INFO L427 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.28/278.93 [2019-03-28 12:42:14,605 WARN L188 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 146 362.28/278.93 [2019-03-28 12:42:14,605 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.28/278.93 [2019-03-28 12:42:14,618 INFO L427 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 362.28/278.93 [2019-03-28 12:42:15,969 WARN L188 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 143 362.28/278.93 [2019-03-28 12:42:15,969 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 362.28/278.93 [2019-03-28 12:42:15,970 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. 362.28/278.93 [2019-03-28 12:42:15,971 INFO L217 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:382, output treesize:656 362.28/278.93 [2019-03-28 12:42:17,483 WARN L188 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 143 362.28/278.93 [2019-03-28 12:42:17,486 INFO L216 LassoAnalysis]: Preferences: 362.28/278.93 [2019-03-28 12:42:17,487 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 362.28/278.93 [2019-03-28 12:42:17,487 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 362.28/278.93 [2019-03-28 12:42:17,487 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 362.28/278.93 [2019-03-28 12:42:17,487 INFO L127 ssoRankerPreferences]: Use exernal solver: false 362.28/278.93 [2019-03-28 12:42:17,487 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 362.28/278.93 [2019-03-28 12:42:17,487 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 362.28/278.93 [2019-03-28 12:42:17,487 INFO L130 ssoRankerPreferences]: Path of dumped script: 362.28/278.93 [2019-03-28 12:42:17,487 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 362.28/278.93 [2019-03-28 12:42:17,487 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 362.28/278.93 [2019-03-28 12:42:17,488 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 362.28/278.93 [2019-03-28 12:42:17,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:17,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:17,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:17,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:17,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:17,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:17,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:17,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:17,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:17,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:17,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:17,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:17,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:17,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:17,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:17,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:17,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:17,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:17,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:17,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:18,686 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 100 362.28/278.93 [2019-03-28 12:42:18,812 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 362.28/278.93 [2019-03-28 12:42:18,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:18,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:18,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:18,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:18,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 362.28/278.93 [2019-03-28 12:42:19,372 INFO L300 LassoAnalysis]: Preprocessing complete. 362.28/278.93 [2019-03-28 12:42:19,372 INFO L497 LassoAnalysis]: Using template 'affine'. 362.28/278.93 [2019-03-28 12:42:19,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 362.28/278.93 [2019-03-28 12:42:19,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 362.28/278.93 [2019-03-28 12:42:19,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 362.28/278.93 Termination analysis: LINEAR_WITH_GUESSES 362.28/278.93 Number of strict supporting invariants: 0 362.28/278.93 Number of non-strict supporting invariants: 1 362.28/278.93 Consider only non-deceasing supporting invariants: true 362.28/278.93 Simplify termination arguments: true 362.28/278.93 Simplify supporting invariants: trueOverapproximate stem: false 362.28/278.93 [2019-03-28 12:42:19,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. 362.28/278.93 [2019-03-28 12:42:19,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 362.28/278.93 [2019-03-28 12:42:19,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 362.28/278.93 [2019-03-28 12:42:19,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 362.28/278.93 [2019-03-28 12:42:19,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 362.28/278.93 [2019-03-28 12:42:19,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 362.28/278.93 [2019-03-28 12:42:19,486 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 362.28/278.93 [2019-03-28 12:42:19,492 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 362.28/278.93 [2019-03-28 12:42:19,492 INFO L444 ModelExtractionUtils]: 58 out of 61 variables were initially zero. Simplification set additionally 1 variables to zero. 362.28/278.93 [2019-03-28 12:42:19,492 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 362.28/278.93 [2019-03-28 12:42:19,493 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 362.28/278.93 [2019-03-28 12:42:19,493 INFO L518 LassoAnalysis]: Proved termination. 362.28/278.93 [2019-03-28 12:42:19,493 INFO L520 LassoAnalysis]: Termination argument consisting of: 362.28/278.93 Ranking function f(ULTIMATE.start_cstpncpy_~n) = 1*ULTIMATE.start_cstpncpy_~n 362.28/278.93 Supporting invariants [] 362.28/278.93 [2019-03-28 12:42:19,586 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed 362.28/278.93 [2019-03-28 12:42:19,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.93 [2019-03-28 12:42:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.28/278.93 [2019-03-28 12:42:19,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core 362.28/278.93 [2019-03-28 12:42:19,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.28/278.93 [2019-03-28 12:42:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.28/278.93 [2019-03-28 12:42:19,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core 362.28/278.93 [2019-03-28 12:42:19,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.28/278.93 [2019-03-28 12:42:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.28/278.93 [2019-03-28 12:42:19,675 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 362.28/278.93 [2019-03-28 12:42:19,675 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates 362.28/278.93 [2019-03-28 12:42:19,675 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 46 states and 64 transitions. cyclomatic complexity: 21 Second operand 4 states. 362.28/278.93 [2019-03-28 12:42:19,736 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 46 states and 64 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 54 states and 74 transitions. Complement of second has 8 states. 362.28/278.93 [2019-03-28 12:42:19,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 362.28/278.93 [2019-03-28 12:42:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 362.28/278.93 [2019-03-28 12:42:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. 362.28/278.93 [2019-03-28 12:42:19,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 16 letters. Loop has 3 letters. 362.28/278.93 [2019-03-28 12:42:19,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. 362.28/278.93 [2019-03-28 12:42:19,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 19 letters. Loop has 3 letters. 362.28/278.93 [2019-03-28 12:42:19,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. 362.28/278.93 [2019-03-28 12:42:19,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 16 letters. Loop has 6 letters. 362.28/278.93 [2019-03-28 12:42:19,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. 362.28/278.93 [2019-03-28 12:42:19,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 74 transitions. 362.28/278.93 [2019-03-28 12:42:19,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 362.28/278.93 [2019-03-28 12:42:19,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 74 transitions. 362.28/278.93 [2019-03-28 12:42:19,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 362.28/278.93 [2019-03-28 12:42:19,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 362.28/278.93 [2019-03-28 12:42:19,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 74 transitions. 362.28/278.93 [2019-03-28 12:42:19,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 362.28/278.93 [2019-03-28 12:42:19,746 INFO L706 BuchiCegarLoop]: Abstraction has 54 states and 74 transitions. 362.28/278.93 [2019-03-28 12:42:19,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 74 transitions. 362.28/278.93 [2019-03-28 12:42:19,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. 362.28/278.93 [2019-03-28 12:42:19,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. 362.28/278.93 [2019-03-28 12:42:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. 362.28/278.93 [2019-03-28 12:42:19,747 INFO L729 BuchiCegarLoop]: Abstraction has 51 states and 71 transitions. 362.28/278.93 [2019-03-28 12:42:19,748 INFO L609 BuchiCegarLoop]: Abstraction has 51 states and 71 transitions. 362.28/278.93 [2019-03-28 12:42:19,748 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 362.28/278.93 [2019-03-28 12:42:19,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 71 transitions. 362.28/278.93 [2019-03-28 12:42:19,748 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 362.28/278.93 [2019-03-28 12:42:19,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 362.28/278.93 [2019-03-28 12:42:19,749 INFO L119 BuchiIsEmpty]: Starting construction of run 362.28/278.93 [2019-03-28 12:42:19,749 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.28/278.93 [2019-03-28 12:42:19,749 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 362.28/278.93 [2019-03-28 12:42:19,750 INFO L794 eck$LassoCheckResult]: Stem: 856#ULTIMATE.startENTRY [236] ULTIMATE.startENTRY-->L29: Formula: (and (= (store |v_#valid_34| 0 0) |v_#valid_33|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_34|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_33|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_#t~ret13.base, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 848#L29 [154] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 842#L29-2 [155] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 843#L32-1 [185] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2| 1))) (and (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2| 1)) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2|) 0) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2|)) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (< |v_ULTIMATE.start_main_#t~malloc12.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc12.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_2| v_ULTIMATE.start_main_~length~0_7)))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_#t~malloc11.base, #length] 838#L37 [117] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8 (- 1))) (.cse1 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8))) (and (= |v_#memory_$Pointer$.offset_1| (store |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 (select (select |v_#memory_$Pointer$.offset_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0)))) (<= .cse1 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString~0.base_3)) (= (store |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 (select (select |v_#memory_$Pointer$.base_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0))) |v_#memory_$Pointer$.base_1|) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 0))) (<= 1 .cse1) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString~0.base_3)))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 839#L37-1 [191] L37-1-->L5: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#in~dst.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_3) (< |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 0) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1|)) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 8)) (< |v_ULTIMATE.start_cstpncpy_~#dst.base_1| |v_#StackHeapBarrier_2|) (= |v_ULTIMATE.start_cstpncpy_#in~dst.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_3) (= |v_ULTIMATE.start_cstpncpy_#in~n_1| v_ULTIMATE.start_main_~n~0_8) (= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_1|) (= |v_ULTIMATE.start_cstpncpy_#in~src.offset_1| v_ULTIMATE.start_main_~nondetString~0.offset_5) (= (store |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 1) |v_#valid_8|) (= |v_ULTIMATE.start_cstpncpy_#in~src.base_1| v_ULTIMATE.start_main_~nondetString~0.base_6)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, #valid=|v_#valid_9|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, #length=|v_#length_7|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_1, ULTIMATE.start_cstpncpy_#t~mem8.base=|v_ULTIMATE.start_cstpncpy_#t~mem8.base_1|, ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_1|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_1|, ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_1|, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_1|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_1|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_1, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_1|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_1, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_1, ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_1|, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_1|, ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_1|, #length=|v_#length_6|, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_1|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_1|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_1, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_1|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_1|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_1|, ULTIMATE.start_cstpncpy_#res.base=|v_ULTIMATE.start_cstpncpy_#res.base_1|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_1|, ULTIMATE.start_cstpncpy_#res.offset=|v_ULTIMATE.start_cstpncpy_#res.offset_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem8.offset=|v_ULTIMATE.start_cstpncpy_#t~mem8.offset_1|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_1, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, #valid=|v_#valid_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_1|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_1|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_#t~mem8.base, ULTIMATE.start_cstpncpy_#t~post7.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#in~src.offset, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~#dst.offset, ULTIMATE.start_cstpncpy_~src.base, ULTIMATE.start_cstpncpy_#in~dst.base, ULTIMATE.start_cstpncpy_#t~mem5, ULTIMATE.start_cstpncpy_~n, ULTIMATE.start_cstpncpy_~s~0.offset, ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~pre2, #length, ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_#in~n, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_#t~mem1.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#res.base, ULTIMATE.start_cstpncpy_#in~src.base, ULTIMATE.start_cstpncpy_#res.offset, ULTIMATE.start_cstpncpy_~#dst.base, ULTIMATE.start_cstpncpy_#t~mem8.offset, ULTIMATE.start_cstpncpy_~src.offset, ULTIMATE.start_cstpncpy_~d~0.offset, #valid, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#in~dst.offset, ULTIMATE.start_cstpncpy_#t~post7.base] 840#L5 [237] L5-->L8: Formula: (and (= v_ULTIMATE.start_cstpncpy_~src.offset_4 |v_ULTIMATE.start_cstpncpy_#in~src.offset_3|) (= (store |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|)) |v_#memory_$Pointer$.offset_16|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|) (= (store |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.base_3|)) |v_#memory_$Pointer$.base_16|) (= v_ULTIMATE.start_cstpncpy_~src.base_4 |v_ULTIMATE.start_cstpncpy_#in~src.base_3|) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| 8) (select |v_#length_26| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|)) (= v_ULTIMATE.start_cstpncpy_~n_10 |v_ULTIMATE.start_cstpncpy_#in~n_3|) (= 1 (select |v_#valid_35| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|)) (= (store |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| (select (select |v_#memory_int_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|))) |v_#memory_int_14|)) InVars {ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} OutVars{ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_16|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_4, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_10, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_4, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~src.offset, #memory_$Pointer$.base, ULTIMATE.start_cstpncpy_~src.base, #memory_int, ULTIMATE.start_cstpncpy_~n, #memory_$Pointer$.offset] 841#L8 [196] L8-->L9: Formula: (> v_ULTIMATE.start_cstpncpy_~n_3 0) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} OutVars{ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} AuxVars[] AssignedVars[] 849#L9 [239] L9-->L12: Formula: (and (= (select |v_#valid_38| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) 1) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_20| 8) (select |v_#length_28| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|)) (= (select (select |v_#memory_$Pointer$.base_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) v_ULTIMATE.start_cstpncpy_~d~0.base_8) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_8 (select (select |v_#memory_$Pointer$.offset_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|)) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) (= v_ULTIMATE.start_cstpncpy_~src.offset_5 v_ULTIMATE.start_cstpncpy_~s~0.offset_5) (= v_ULTIMATE.start_cstpncpy_~src.base_5 v_ULTIMATE.start_cstpncpy_~s~0.base_5)) InVars {ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_8, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_5, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_8, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_5|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_5, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 850#L12 [141] L12-->L12-1: Formula: (and (= (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|) (= (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) (= (select |v_#valid_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) 1) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_7| 8) (select |v_#length_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem1.offset] 857#L12-1 [243] L12-1-->L13-4: Formula: (and (= (store |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (select (select |v_#memory_int_16| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|))) |v_#memory_int_16|) (= |v_#memory_$Pointer$.offset_23| (store |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (+ (mod v_ULTIMATE.start_cstpncpy_~n_11 4294967296) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|)))) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| 8) (select |v_#length_32| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (= (store |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| |v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|)) |v_#memory_$Pointer$.base_23|) (= 1 (select |v_#valid_46| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|)) InVars {ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_24|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_24|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_23|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_16|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_23|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset, ULTIMATE.start_cstpncpy_#t~mem1.offset] 858#L13-4 [134] L13-4-->L14: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| v_ULTIMATE.start_cstpncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| v_ULTIMATE.start_cstpncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| 1)) (= |v_ULTIMATE.start_cstpncpy_#t~post3.base_2| v_ULTIMATE.start_cstpncpy_~d~0.base_4) (= v_ULTIMATE.start_cstpncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| 1)) (= v_ULTIMATE.start_cstpncpy_~s~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post4.base_2|) (= v_ULTIMATE.start_cstpncpy_~d~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post3.base_2|) (= |v_ULTIMATE.start_cstpncpy_#t~post4.base_2| v_ULTIMATE.start_cstpncpy_~s~0.base_4)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_4, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_4, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_4, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_4} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_3, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_2|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_2|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_2|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_2|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_3, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 852#L14 [111] L14-->L14-1: Formula: (and (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) (= (select |v_#valid_18| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) 1) (= (select (select |v_#memory_int_7| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) |v_ULTIMATE.start_cstpncpy_#t~mem5_2|) (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_16|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_2|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem5] 869#L14-1 [107] L14-1-->L14-2: Formula: (and (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| 1) (select |v_#length_18| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (= (store |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.base_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.base_9|) (= (store |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.offset_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.offset_9|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|) (= |v_#memory_int_8| (store |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| |v_ULTIMATE.start_cstpncpy_#t~mem5_3|)))) InVars {ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_10|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_10|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_9|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 865#L14-2 [105] L14-2-->L15: Formula: (= 0 |v_ULTIMATE.start_cstpncpy_#t~mem5_5|) InVars {ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_5|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_5|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_4|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_6|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_6|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#t~mem5] 832#L15 [114] L15-->L17-2: Formula: (and (= 1 (select |v_#valid_22| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|)) (= |v_#memory_$Pointer$.base_11| (store |v_#memory_$Pointer$.base_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_15| (store (select |v_#memory_$Pointer$.base_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_11| v_ULTIMATE.start_cstpncpy_~d~0.base_5))) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_11|) (= (store |v_#memory_$Pointer$.offset_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_15| (store (select |v_#memory_$Pointer$.offset_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_11| (+ v_ULTIMATE.start_cstpncpy_~d~0.offset_5 (- 1)))) |v_#memory_$Pointer$.offset_11|) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_11| 8) (select |v_#length_20| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|)) (= (store |v_#memory_int_11| |v_ULTIMATE.start_cstpncpy_~#dst.base_15| (store (select |v_#memory_int_11| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_11| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_11|))) |v_#memory_int_10|)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_5, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_5, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_12|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_11|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_15|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_12|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_5, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_5, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_11|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_11|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_20|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_15|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_11|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 833#L17-2 [147] L17-2-->L17: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstpncpy_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstpncpy_~n_5 .cse0) (= |v_ULTIMATE.start_cstpncpy_#t~pre6_2| .cse0))) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_6} OutVars{ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_2|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_~n] 835#L17 362.28/278.93 [2019-03-28 12:42:19,751 INFO L796 eck$LassoCheckResult]: Loop: 835#L17 [231] L17-->L18: Formula: (and (= v_ULTIMATE.start_cstpncpy_~d~0.offset_6 (+ |v_ULTIMATE.start_cstpncpy_#t~post7.offset_2| 1)) (= |v_ULTIMATE.start_cstpncpy_#t~post7.base_2| v_ULTIMATE.start_cstpncpy_~d~0.base_7) (= v_ULTIMATE.start_cstpncpy_~d~0.base_6 |v_ULTIMATE.start_cstpncpy_#t~post7.base_2|) (> 0 |v_ULTIMATE.start_cstpncpy_#t~pre6_6|) (= |v_ULTIMATE.start_cstpncpy_#t~post7.offset_2| v_ULTIMATE.start_cstpncpy_~d~0.offset_7)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_7, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_7, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_6|} OutVars{ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_6, ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_6, ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_2|, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_5|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_#t~post7.offset, ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_#t~post7.base] 845#L18 [244] L18-->L17-2: Formula: (and (= (store |v_#memory_$Pointer$.base_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8| (store (select |v_#memory_$Pointer$.base_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| (select (select |v_#memory_$Pointer$.base_25| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|))) |v_#memory_$Pointer$.base_25|) (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| 1) (select |v_#length_33| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|)) (= (store |v_#memory_$Pointer$.offset_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8| (store (select |v_#memory_$Pointer$.offset_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| (select (select |v_#memory_$Pointer$.offset_25| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|))) |v_#memory_$Pointer$.offset_25|) (= (store |v_#memory_int_19| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8| (store (select |v_#memory_int_19| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| 0)) |v_#memory_int_18|) (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|) (= 1 (select |v_#valid_47| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|))) InVars {ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_26|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_19|, #length=|v_#length_33|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_8|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_26|} OutVars{ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_6|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_25|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_33|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_7|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_25|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~post7.offset, #memory_$Pointer$.base, #memory_int, ULTIMATE.start_cstpncpy_#t~post7.base, #memory_$Pointer$.offset] 834#L17-2 [147] L17-2-->L17: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstpncpy_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstpncpy_~n_5 .cse0) (= |v_ULTIMATE.start_cstpncpy_#t~pre6_2| .cse0))) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_6} OutVars{ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_2|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_~n] 835#L17 362.28/278.93 [2019-03-28 12:42:19,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.93 [2019-03-28 12:42:19,751 INFO L82 PathProgramCache]: Analyzing trace with hash -673847409, now seen corresponding path program 1 times 362.28/278.93 [2019-03-28 12:42:19,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.93 [2019-03-28 12:42:19,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.93 [2019-03-28 12:42:19,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:19,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:19,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:19,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.93 [2019-03-28 12:42:19,776 INFO L82 PathProgramCache]: Analyzing trace with hash 259493, now seen corresponding path program 1 times 362.28/278.93 [2019-03-28 12:42:19,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.93 [2019-03-28 12:42:19,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.93 [2019-03-28 12:42:19,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:19,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:19,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:19,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.93 [2019-03-28 12:42:19,781 INFO L82 PathProgramCache]: Analyzing trace with hash 89209687, now seen corresponding path program 1 times 362.28/278.93 [2019-03-28 12:42:19,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.93 [2019-03-28 12:42:19,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.93 [2019-03-28 12:42:19,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:19,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:19,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.28/278.93 [2019-03-28 12:42:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.28/278.93 [2019-03-28 12:42:19,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.28/278.93 [2019-03-28 12:42:19,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 362.28/278.93 [2019-03-28 12:42:19,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 362.28/278.93 [2019-03-28 12:42:19,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 362.28/278.93 [2019-03-28 12:42:19,886 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. cyclomatic complexity: 24 Second operand 4 states. 362.28/278.93 [2019-03-28 12:42:19,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.28/278.93 [2019-03-28 12:42:19,940 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. 362.28/278.93 [2019-03-28 12:42:19,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 362.28/278.93 [2019-03-28 12:42:19,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 75 transitions. 362.28/278.93 [2019-03-28 12:42:19,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 362.28/278.93 [2019-03-28 12:42:19,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 54 states and 74 transitions. 362.28/278.93 [2019-03-28 12:42:19,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 362.28/278.93 [2019-03-28 12:42:19,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 362.28/278.93 [2019-03-28 12:42:19,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 74 transitions. 362.28/278.93 [2019-03-28 12:42:19,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 362.28/278.93 [2019-03-28 12:42:19,946 INFO L706 BuchiCegarLoop]: Abstraction has 54 states and 74 transitions. 362.28/278.93 [2019-03-28 12:42:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 74 transitions. 362.28/278.93 [2019-03-28 12:42:19,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. 362.28/278.93 [2019-03-28 12:42:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. 362.28/278.93 [2019-03-28 12:42:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. 362.28/278.93 [2019-03-28 12:42:19,948 INFO L729 BuchiCegarLoop]: Abstraction has 54 states and 74 transitions. 362.28/278.93 [2019-03-28 12:42:19,948 INFO L609 BuchiCegarLoop]: Abstraction has 54 states and 74 transitions. 362.28/278.93 [2019-03-28 12:42:19,948 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 362.28/278.93 [2019-03-28 12:42:19,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 74 transitions. 362.28/278.93 [2019-03-28 12:42:19,949 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 362.28/278.93 [2019-03-28 12:42:19,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 362.28/278.93 [2019-03-28 12:42:19,949 INFO L119 BuchiIsEmpty]: Starting construction of run 362.28/278.93 [2019-03-28 12:42:19,949 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.28/278.93 [2019-03-28 12:42:19,949 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 362.28/278.93 [2019-03-28 12:42:19,950 INFO L794 eck$LassoCheckResult]: Stem: 971#ULTIMATE.startENTRY [236] ULTIMATE.startENTRY-->L29: Formula: (and (= (store |v_#valid_34| 0 0) |v_#valid_33|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_34|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_33|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_#t~ret13.base, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 964#L29 [154] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 956#L29-2 [155] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 957#L32-1 [185] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2| 1))) (and (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2| 1)) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2|) 0) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2|)) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (< |v_ULTIMATE.start_main_#t~malloc12.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc12.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_2| v_ULTIMATE.start_main_~length~0_7)))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_#t~malloc11.base, #length] 952#L37 [117] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8 (- 1))) (.cse1 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8))) (and (= |v_#memory_$Pointer$.offset_1| (store |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 (select (select |v_#memory_$Pointer$.offset_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0)))) (<= .cse1 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString~0.base_3)) (= (store |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 (select (select |v_#memory_$Pointer$.base_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0))) |v_#memory_$Pointer$.base_1|) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 0))) (<= 1 .cse1) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString~0.base_3)))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 953#L37-1 [191] L37-1-->L5: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#in~dst.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_3) (< |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 0) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1|)) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 8)) (< |v_ULTIMATE.start_cstpncpy_~#dst.base_1| |v_#StackHeapBarrier_2|) (= |v_ULTIMATE.start_cstpncpy_#in~dst.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_3) (= |v_ULTIMATE.start_cstpncpy_#in~n_1| v_ULTIMATE.start_main_~n~0_8) (= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_1|) (= |v_ULTIMATE.start_cstpncpy_#in~src.offset_1| v_ULTIMATE.start_main_~nondetString~0.offset_5) (= (store |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 1) |v_#valid_8|) (= |v_ULTIMATE.start_cstpncpy_#in~src.base_1| v_ULTIMATE.start_main_~nondetString~0.base_6)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, #valid=|v_#valid_9|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, #length=|v_#length_7|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_1, ULTIMATE.start_cstpncpy_#t~mem8.base=|v_ULTIMATE.start_cstpncpy_#t~mem8.base_1|, ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_1|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_1|, ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_1|, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_1|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_1|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_1, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_1|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_1, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_1, ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_1|, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_1|, ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_1|, #length=|v_#length_6|, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_1|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_1|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_1, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_1|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_1|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_1|, ULTIMATE.start_cstpncpy_#res.base=|v_ULTIMATE.start_cstpncpy_#res.base_1|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_1|, ULTIMATE.start_cstpncpy_#res.offset=|v_ULTIMATE.start_cstpncpy_#res.offset_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem8.offset=|v_ULTIMATE.start_cstpncpy_#t~mem8.offset_1|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_1, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, #valid=|v_#valid_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_1|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_1|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_#t~mem8.base, ULTIMATE.start_cstpncpy_#t~post7.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#in~src.offset, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~#dst.offset, ULTIMATE.start_cstpncpy_~src.base, ULTIMATE.start_cstpncpy_#in~dst.base, ULTIMATE.start_cstpncpy_#t~mem5, ULTIMATE.start_cstpncpy_~n, ULTIMATE.start_cstpncpy_~s~0.offset, ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~pre2, #length, ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_#in~n, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_#t~mem1.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#res.base, ULTIMATE.start_cstpncpy_#in~src.base, ULTIMATE.start_cstpncpy_#res.offset, ULTIMATE.start_cstpncpy_~#dst.base, ULTIMATE.start_cstpncpy_#t~mem8.offset, ULTIMATE.start_cstpncpy_~src.offset, ULTIMATE.start_cstpncpy_~d~0.offset, #valid, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#in~dst.offset, ULTIMATE.start_cstpncpy_#t~post7.base] 954#L5 [237] L5-->L8: Formula: (and (= v_ULTIMATE.start_cstpncpy_~src.offset_4 |v_ULTIMATE.start_cstpncpy_#in~src.offset_3|) (= (store |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|)) |v_#memory_$Pointer$.offset_16|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|) (= (store |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.base_3|)) |v_#memory_$Pointer$.base_16|) (= v_ULTIMATE.start_cstpncpy_~src.base_4 |v_ULTIMATE.start_cstpncpy_#in~src.base_3|) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| 8) (select |v_#length_26| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|)) (= v_ULTIMATE.start_cstpncpy_~n_10 |v_ULTIMATE.start_cstpncpy_#in~n_3|) (= 1 (select |v_#valid_35| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|)) (= (store |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| (select (select |v_#memory_int_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|))) |v_#memory_int_14|)) InVars {ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} OutVars{ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_16|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_4, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_10, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_4, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~src.offset, #memory_$Pointer$.base, ULTIMATE.start_cstpncpy_~src.base, #memory_int, ULTIMATE.start_cstpncpy_~n, #memory_$Pointer$.offset] 955#L8 [196] L8-->L9: Formula: (> v_ULTIMATE.start_cstpncpy_~n_3 0) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} OutVars{ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} AuxVars[] AssignedVars[] 965#L9 [239] L9-->L12: Formula: (and (= (select |v_#valid_38| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) 1) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_20| 8) (select |v_#length_28| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|)) (= (select (select |v_#memory_$Pointer$.base_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) v_ULTIMATE.start_cstpncpy_~d~0.base_8) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_8 (select (select |v_#memory_$Pointer$.offset_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|)) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) (= v_ULTIMATE.start_cstpncpy_~src.offset_5 v_ULTIMATE.start_cstpncpy_~s~0.offset_5) (= v_ULTIMATE.start_cstpncpy_~src.base_5 v_ULTIMATE.start_cstpncpy_~s~0.base_5)) InVars {ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_8, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_5, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_8, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_5|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_5, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 966#L12 [141] L12-->L12-1: Formula: (and (= (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|) (= (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) (= (select |v_#valid_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) 1) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_7| 8) (select |v_#length_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem1.offset] 995#L12-1 [243] L12-1-->L13-4: Formula: (and (= (store |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (select (select |v_#memory_int_16| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|))) |v_#memory_int_16|) (= |v_#memory_$Pointer$.offset_23| (store |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (+ (mod v_ULTIMATE.start_cstpncpy_~n_11 4294967296) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|)))) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| 8) (select |v_#length_32| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (= (store |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| |v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|)) |v_#memory_$Pointer$.base_23|) (= 1 (select |v_#valid_46| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|)) InVars {ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_24|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_24|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_23|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_16|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_23|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset, ULTIMATE.start_cstpncpy_#t~mem1.offset] 994#L13-4 [134] L13-4-->L14: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| v_ULTIMATE.start_cstpncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| v_ULTIMATE.start_cstpncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| 1)) (= |v_ULTIMATE.start_cstpncpy_#t~post3.base_2| v_ULTIMATE.start_cstpncpy_~d~0.base_4) (= v_ULTIMATE.start_cstpncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| 1)) (= v_ULTIMATE.start_cstpncpy_~s~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post4.base_2|) (= v_ULTIMATE.start_cstpncpy_~d~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post3.base_2|) (= |v_ULTIMATE.start_cstpncpy_#t~post4.base_2| v_ULTIMATE.start_cstpncpy_~s~0.base_4)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_4, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_4, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_4, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_4} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_3, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_2|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_2|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_2|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_2|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_3, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 985#L14 [111] L14-->L14-1: Formula: (and (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) (= (select |v_#valid_18| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) 1) (= (select (select |v_#memory_int_7| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) |v_ULTIMATE.start_cstpncpy_#t~mem5_2|) (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_16|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_2|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem5] 986#L14-1 [107] L14-1-->L14-2: Formula: (and (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| 1) (select |v_#length_18| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (= (store |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.base_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.base_9|) (= (store |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.offset_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.offset_9|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|) (= |v_#memory_int_8| (store |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| |v_ULTIMATE.start_cstpncpy_#t~mem5_3|)))) InVars {ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_10|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_10|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_9|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 993#L14-2 [223] L14-2-->L13-1: Formula: (> 0 |v_ULTIMATE.start_cstpncpy_#t~mem5_7|) InVars {ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_7|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_6|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_6|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_6|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_7|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#t~mem5] 982#L13-1 [153] L13-1-->L13-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstpncpy_~n_8 (- 1)))) (and (= |v_ULTIMATE.start_cstpncpy_#t~pre2_2| .cse0) (= v_ULTIMATE.start_cstpncpy_~n_7 .cse0))) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_8} OutVars{ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_2|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre2, ULTIMATE.start_cstpncpy_~n] 975#L13-2 [228] L13-2-->L13-4: Formula: (< 0 |v_ULTIMATE.start_cstpncpy_#t~pre2_6|) InVars {ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_6|} OutVars{ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre2] 976#L13-4 [134] L13-4-->L14: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| v_ULTIMATE.start_cstpncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| v_ULTIMATE.start_cstpncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| 1)) (= |v_ULTIMATE.start_cstpncpy_#t~post3.base_2| v_ULTIMATE.start_cstpncpy_~d~0.base_4) (= v_ULTIMATE.start_cstpncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| 1)) (= v_ULTIMATE.start_cstpncpy_~s~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post4.base_2|) (= v_ULTIMATE.start_cstpncpy_~d~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post3.base_2|) (= |v_ULTIMATE.start_cstpncpy_#t~post4.base_2| v_ULTIMATE.start_cstpncpy_~s~0.base_4)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_4, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_4, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_4, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_4} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_3, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_2|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_2|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_2|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_2|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_3, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 991#L14 362.28/278.93 [2019-03-28 12:42:19,951 INFO L796 eck$LassoCheckResult]: Loop: 991#L14 [111] L14-->L14-1: Formula: (and (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) (= (select |v_#valid_18| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) 1) (= (select (select |v_#memory_int_7| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) |v_ULTIMATE.start_cstpncpy_#t~mem5_2|) (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_16|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_2|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem5] 989#L14-1 [107] L14-1-->L14-2: Formula: (and (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| 1) (select |v_#length_18| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (= (store |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.base_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.base_9|) (= (store |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.offset_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.offset_9|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|) (= |v_#memory_int_8| (store |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| |v_ULTIMATE.start_cstpncpy_#t~mem5_3|)))) InVars {ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_10|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_10|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_9|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 987#L14-2 [222] L14-2-->L13-1: Formula: (< 0 |v_ULTIMATE.start_cstpncpy_#t~mem5_7|) InVars {ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_7|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_6|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_6|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_6|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_7|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#t~mem5] 981#L13-1 [153] L13-1-->L13-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstpncpy_~n_8 (- 1)))) (and (= |v_ULTIMATE.start_cstpncpy_#t~pre2_2| .cse0) (= v_ULTIMATE.start_cstpncpy_~n_7 .cse0))) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_8} OutVars{ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_2|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre2, ULTIMATE.start_cstpncpy_~n] 973#L13-2 [229] L13-2-->L13-4: Formula: (> 0 |v_ULTIMATE.start_cstpncpy_#t~pre2_6|) InVars {ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_6|} OutVars{ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre2] 974#L13-4 [134] L13-4-->L14: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| v_ULTIMATE.start_cstpncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| v_ULTIMATE.start_cstpncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| 1)) (= |v_ULTIMATE.start_cstpncpy_#t~post3.base_2| v_ULTIMATE.start_cstpncpy_~d~0.base_4) (= v_ULTIMATE.start_cstpncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| 1)) (= v_ULTIMATE.start_cstpncpy_~s~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post4.base_2|) (= v_ULTIMATE.start_cstpncpy_~d~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post3.base_2|) (= |v_ULTIMATE.start_cstpncpy_#t~post4.base_2| v_ULTIMATE.start_cstpncpy_~s~0.base_4)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_4, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_4, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_4, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_4} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_3, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_2|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_2|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_2|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_2|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_3, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 991#L14 362.28/278.93 [2019-03-28 12:42:19,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.93 [2019-03-28 12:42:19,951 INFO L82 PathProgramCache]: Analyzing trace with hash 589122263, now seen corresponding path program 1 times 362.28/278.93 [2019-03-28 12:42:19,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.93 [2019-03-28 12:42:19,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.93 [2019-03-28 12:42:19,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:19,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:19,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:19,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.93 [2019-03-28 12:42:19,976 INFO L82 PathProgramCache]: Analyzing trace with hash -124043239, now seen corresponding path program 2 times 362.28/278.93 [2019-03-28 12:42:19,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.93 [2019-03-28 12:42:19,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.93 [2019-03-28 12:42:19,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:19,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:19,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:19,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.93 [2019-03-28 12:42:19,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1468961391, now seen corresponding path program 1 times 362.28/278.93 [2019-03-28 12:42:19,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.93 [2019-03-28 12:42:19,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.93 [2019-03-28 12:42:19,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:19,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:19,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.28/278.93 [2019-03-28 12:42:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.28/278.93 [2019-03-28 12:42:20,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.28/278.93 [2019-03-28 12:42:20,010 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.28/278.93 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.28/278.93 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.28/278.93 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.28/278.93 [2019-03-28 12:42:20,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.28/278.93 [2019-03-28 12:42:20,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjunts are in the unsatisfiable core 362.28/278.93 [2019-03-28 12:42:20,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.28/278.93 [2019-03-28 12:42:20,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.28/278.93 [2019-03-28 12:42:20,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.28/278.93 [2019-03-28 12:42:20,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 362.28/278.93 [2019-03-28 12:42:20,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 362.28/278.93 [2019-03-28 12:42:20,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 362.28/278.93 [2019-03-28 12:42:20,257 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. cyclomatic complexity: 24 Second operand 5 states. 362.28/278.93 [2019-03-28 12:42:20,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.28/278.93 [2019-03-28 12:42:20,335 INFO L93 Difference]: Finished difference Result 52 states and 70 transitions. 362.28/278.93 [2019-03-28 12:42:20,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 362.28/278.93 [2019-03-28 12:42:20,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 70 transitions. 362.28/278.93 [2019-03-28 12:42:20,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 362.28/278.93 [2019-03-28 12:42:20,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 50 states and 67 transitions. 362.28/278.93 [2019-03-28 12:42:20,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 362.28/278.93 [2019-03-28 12:42:20,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 362.28/278.93 [2019-03-28 12:42:20,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 67 transitions. 362.28/278.93 [2019-03-28 12:42:20,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 362.28/278.93 [2019-03-28 12:42:20,341 INFO L706 BuchiCegarLoop]: Abstraction has 50 states and 67 transitions. 362.28/278.93 [2019-03-28 12:42:20,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 67 transitions. 362.28/278.93 [2019-03-28 12:42:20,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. 362.28/278.93 [2019-03-28 12:42:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. 362.28/278.93 [2019-03-28 12:42:20,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. 362.28/278.93 [2019-03-28 12:42:20,342 INFO L729 BuchiCegarLoop]: Abstraction has 45 states and 61 transitions. 362.28/278.93 [2019-03-28 12:42:20,342 INFO L609 BuchiCegarLoop]: Abstraction has 45 states and 61 transitions. 362.28/278.93 [2019-03-28 12:42:20,342 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 362.28/278.93 [2019-03-28 12:42:20,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 61 transitions. 362.28/278.93 [2019-03-28 12:42:20,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 362.28/278.93 [2019-03-28 12:42:20,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 362.28/278.93 [2019-03-28 12:42:20,343 INFO L119 BuchiIsEmpty]: Starting construction of run 362.28/278.93 [2019-03-28 12:42:20,344 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.28/278.93 [2019-03-28 12:42:20,344 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 362.28/278.93 [2019-03-28 12:42:20,345 INFO L794 eck$LassoCheckResult]: Stem: 1159#ULTIMATE.startENTRY [236] ULTIMATE.startENTRY-->L29: Formula: (and (= (store |v_#valid_34| 0 0) |v_#valid_33|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_34|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_33|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_#t~ret13.base, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 1151#L29 [154] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 1143#L29-2 [155] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 1144#L32-1 [185] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2| 1))) (and (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2| 1)) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2|) 0) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2|)) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (< |v_ULTIMATE.start_main_#t~malloc12.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc12.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_2| v_ULTIMATE.start_main_~length~0_7)))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_#t~malloc11.base, #length] 1139#L37 [117] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8 (- 1))) (.cse1 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8))) (and (= |v_#memory_$Pointer$.offset_1| (store |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 (select (select |v_#memory_$Pointer$.offset_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0)))) (<= .cse1 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString~0.base_3)) (= (store |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 (select (select |v_#memory_$Pointer$.base_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0))) |v_#memory_$Pointer$.base_1|) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 0))) (<= 1 .cse1) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString~0.base_3)))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 1140#L37-1 [191] L37-1-->L5: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#in~dst.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_3) (< |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 0) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1|)) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 8)) (< |v_ULTIMATE.start_cstpncpy_~#dst.base_1| |v_#StackHeapBarrier_2|) (= |v_ULTIMATE.start_cstpncpy_#in~dst.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_3) (= |v_ULTIMATE.start_cstpncpy_#in~n_1| v_ULTIMATE.start_main_~n~0_8) (= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_1|) (= |v_ULTIMATE.start_cstpncpy_#in~src.offset_1| v_ULTIMATE.start_main_~nondetString~0.offset_5) (= (store |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 1) |v_#valid_8|) (= |v_ULTIMATE.start_cstpncpy_#in~src.base_1| v_ULTIMATE.start_main_~nondetString~0.base_6)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, #valid=|v_#valid_9|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, #length=|v_#length_7|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_1, ULTIMATE.start_cstpncpy_#t~mem8.base=|v_ULTIMATE.start_cstpncpy_#t~mem8.base_1|, ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_1|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_1|, ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_1|, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_1|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_1|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_1, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_1|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_1, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_1, ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_1|, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_1|, ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_1|, #length=|v_#length_6|, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_1|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_1|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_1, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_1|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_1|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_1|, ULTIMATE.start_cstpncpy_#res.base=|v_ULTIMATE.start_cstpncpy_#res.base_1|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_1|, ULTIMATE.start_cstpncpy_#res.offset=|v_ULTIMATE.start_cstpncpy_#res.offset_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem8.offset=|v_ULTIMATE.start_cstpncpy_#t~mem8.offset_1|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_1, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, #valid=|v_#valid_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_1|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_1|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_#t~mem8.base, ULTIMATE.start_cstpncpy_#t~post7.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#in~src.offset, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~#dst.offset, ULTIMATE.start_cstpncpy_~src.base, ULTIMATE.start_cstpncpy_#in~dst.base, ULTIMATE.start_cstpncpy_#t~mem5, ULTIMATE.start_cstpncpy_~n, ULTIMATE.start_cstpncpy_~s~0.offset, ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~pre2, #length, ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_#in~n, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_#t~mem1.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#res.base, ULTIMATE.start_cstpncpy_#in~src.base, ULTIMATE.start_cstpncpy_#res.offset, ULTIMATE.start_cstpncpy_~#dst.base, ULTIMATE.start_cstpncpy_#t~mem8.offset, ULTIMATE.start_cstpncpy_~src.offset, ULTIMATE.start_cstpncpy_~d~0.offset, #valid, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#in~dst.offset, ULTIMATE.start_cstpncpy_#t~post7.base] 1141#L5 [237] L5-->L8: Formula: (and (= v_ULTIMATE.start_cstpncpy_~src.offset_4 |v_ULTIMATE.start_cstpncpy_#in~src.offset_3|) (= (store |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|)) |v_#memory_$Pointer$.offset_16|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|) (= (store |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.base_3|)) |v_#memory_$Pointer$.base_16|) (= v_ULTIMATE.start_cstpncpy_~src.base_4 |v_ULTIMATE.start_cstpncpy_#in~src.base_3|) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| 8) (select |v_#length_26| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|)) (= v_ULTIMATE.start_cstpncpy_~n_10 |v_ULTIMATE.start_cstpncpy_#in~n_3|) (= 1 (select |v_#valid_35| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|)) (= (store |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| (select (select |v_#memory_int_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|))) |v_#memory_int_14|)) InVars {ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} OutVars{ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_16|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_4, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_10, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_4, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~src.offset, #memory_$Pointer$.base, ULTIMATE.start_cstpncpy_~src.base, #memory_int, ULTIMATE.start_cstpncpy_~n, #memory_$Pointer$.offset] 1142#L8 [196] L8-->L9: Formula: (> v_ULTIMATE.start_cstpncpy_~n_3 0) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} OutVars{ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} AuxVars[] AssignedVars[] 1152#L9 [239] L9-->L12: Formula: (and (= (select |v_#valid_38| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) 1) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_20| 8) (select |v_#length_28| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|)) (= (select (select |v_#memory_$Pointer$.base_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) v_ULTIMATE.start_cstpncpy_~d~0.base_8) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_8 (select (select |v_#memory_$Pointer$.offset_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|)) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) (= v_ULTIMATE.start_cstpncpy_~src.offset_5 v_ULTIMATE.start_cstpncpy_~s~0.offset_5) (= v_ULTIMATE.start_cstpncpy_~src.base_5 v_ULTIMATE.start_cstpncpy_~s~0.base_5)) InVars {ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_8, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_5, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_8, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_5|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_5, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 1153#L12 [141] L12-->L12-1: Formula: (and (= (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|) (= (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) (= (select |v_#valid_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) 1) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_7| 8) (select |v_#length_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem1.offset] 1173#L12-1 [243] L12-1-->L13-4: Formula: (and (= (store |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (select (select |v_#memory_int_16| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|))) |v_#memory_int_16|) (= |v_#memory_$Pointer$.offset_23| (store |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (+ (mod v_ULTIMATE.start_cstpncpy_~n_11 4294967296) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|)))) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| 8) (select |v_#length_32| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (= (store |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| |v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|)) |v_#memory_$Pointer$.base_23|) (= 1 (select |v_#valid_46| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|)) InVars {ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_24|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_24|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_23|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_16|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_23|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset, ULTIMATE.start_cstpncpy_#t~mem1.offset] 1172#L13-4 [134] L13-4-->L14: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| v_ULTIMATE.start_cstpncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| v_ULTIMATE.start_cstpncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| 1)) (= |v_ULTIMATE.start_cstpncpy_#t~post3.base_2| v_ULTIMATE.start_cstpncpy_~d~0.base_4) (= v_ULTIMATE.start_cstpncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| 1)) (= v_ULTIMATE.start_cstpncpy_~s~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post4.base_2|) (= v_ULTIMATE.start_cstpncpy_~d~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post3.base_2|) (= |v_ULTIMATE.start_cstpncpy_#t~post4.base_2| v_ULTIMATE.start_cstpncpy_~s~0.base_4)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_4, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_4, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_4, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_4} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_3, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_2|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_2|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_2|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_2|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_3, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 1155#L14 [111] L14-->L14-1: Formula: (and (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) (= (select |v_#valid_18| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) 1) (= (select (select |v_#memory_int_7| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) |v_ULTIMATE.start_cstpncpy_#t~mem5_2|) (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_16|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_2|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem5] 1166#L14-1 [107] L14-1-->L14-2: Formula: (and (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| 1) (select |v_#length_18| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (= (store |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.base_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.base_9|) (= (store |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.offset_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.offset_9|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|) (= |v_#memory_int_8| (store |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| |v_ULTIMATE.start_cstpncpy_#t~mem5_3|)))) InVars {ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_10|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_10|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_9|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 1163#L14-2 [105] L14-2-->L15: Formula: (= 0 |v_ULTIMATE.start_cstpncpy_#t~mem5_5|) InVars {ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_5|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_5|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_4|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_6|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_6|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#t~mem5] 1134#L15 [114] L15-->L17-2: Formula: (and (= 1 (select |v_#valid_22| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|)) (= |v_#memory_$Pointer$.base_11| (store |v_#memory_$Pointer$.base_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_15| (store (select |v_#memory_$Pointer$.base_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_11| v_ULTIMATE.start_cstpncpy_~d~0.base_5))) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_11|) (= (store |v_#memory_$Pointer$.offset_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_15| (store (select |v_#memory_$Pointer$.offset_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_11| (+ v_ULTIMATE.start_cstpncpy_~d~0.offset_5 (- 1)))) |v_#memory_$Pointer$.offset_11|) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_11| 8) (select |v_#length_20| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|)) (= (store |v_#memory_int_11| |v_ULTIMATE.start_cstpncpy_~#dst.base_15| (store (select |v_#memory_int_11| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_11| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_11|))) |v_#memory_int_10|)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_5, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_5, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_12|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_11|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_15|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_12|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_5, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_5, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_11|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_11|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_20|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_15|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_11|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 1135#L17-2 [147] L17-2-->L17: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstpncpy_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstpncpy_~n_5 .cse0) (= |v_ULTIMATE.start_cstpncpy_#t~pre6_2| .cse0))) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_6} OutVars{ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_2|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_~n] 1136#L17 [230] L17-->L18: Formula: (and (= v_ULTIMATE.start_cstpncpy_~d~0.offset_6 (+ |v_ULTIMATE.start_cstpncpy_#t~post7.offset_2| 1)) (< 0 |v_ULTIMATE.start_cstpncpy_#t~pre6_6|) (= |v_ULTIMATE.start_cstpncpy_#t~post7.base_2| v_ULTIMATE.start_cstpncpy_~d~0.base_7) (= v_ULTIMATE.start_cstpncpy_~d~0.base_6 |v_ULTIMATE.start_cstpncpy_#t~post7.base_2|) (= |v_ULTIMATE.start_cstpncpy_#t~post7.offset_2| v_ULTIMATE.start_cstpncpy_~d~0.offset_7)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_7, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_7, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_6|} OutVars{ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_6, ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_6, ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_2|, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_5|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_#t~post7.offset, ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_#t~post7.base] 1148#L18 [244] L18-->L17-2: Formula: (and (= (store |v_#memory_$Pointer$.base_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8| (store (select |v_#memory_$Pointer$.base_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| (select (select |v_#memory_$Pointer$.base_25| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|))) |v_#memory_$Pointer$.base_25|) (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| 1) (select |v_#length_33| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|)) (= (store |v_#memory_$Pointer$.offset_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8| (store (select |v_#memory_$Pointer$.offset_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| (select (select |v_#memory_$Pointer$.offset_25| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|))) |v_#memory_$Pointer$.offset_25|) (= (store |v_#memory_int_19| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8| (store (select |v_#memory_int_19| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| 0)) |v_#memory_int_18|) (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|) (= 1 (select |v_#valid_47| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|))) InVars {ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_26|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_19|, #length=|v_#length_33|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_8|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_26|} OutVars{ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_6|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_25|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_33|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_7|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_25|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~post7.offset, #memory_$Pointer$.base, #memory_int, ULTIMATE.start_cstpncpy_#t~post7.base, #memory_$Pointer$.offset] 1149#L17-2 362.28/278.93 [2019-03-28 12:42:20,345 INFO L796 eck$LassoCheckResult]: Loop: 1149#L17-2 [147] L17-2-->L17: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstpncpy_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstpncpy_~n_5 .cse0) (= |v_ULTIMATE.start_cstpncpy_#t~pre6_2| .cse0))) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_6} OutVars{ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_2|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_~n] 1146#L17 [231] L17-->L18: Formula: (and (= v_ULTIMATE.start_cstpncpy_~d~0.offset_6 (+ |v_ULTIMATE.start_cstpncpy_#t~post7.offset_2| 1)) (= |v_ULTIMATE.start_cstpncpy_#t~post7.base_2| v_ULTIMATE.start_cstpncpy_~d~0.base_7) (= v_ULTIMATE.start_cstpncpy_~d~0.base_6 |v_ULTIMATE.start_cstpncpy_#t~post7.base_2|) (> 0 |v_ULTIMATE.start_cstpncpy_#t~pre6_6|) (= |v_ULTIMATE.start_cstpncpy_#t~post7.offset_2| v_ULTIMATE.start_cstpncpy_~d~0.offset_7)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_7, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_7, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_6|} OutVars{ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_6, ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_6, ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_2|, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_5|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_#t~post7.offset, ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_#t~post7.base] 1147#L18 [244] L18-->L17-2: Formula: (and (= (store |v_#memory_$Pointer$.base_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8| (store (select |v_#memory_$Pointer$.base_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| (select (select |v_#memory_$Pointer$.base_25| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|))) |v_#memory_$Pointer$.base_25|) (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| 1) (select |v_#length_33| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|)) (= (store |v_#memory_$Pointer$.offset_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8| (store (select |v_#memory_$Pointer$.offset_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| (select (select |v_#memory_$Pointer$.offset_25| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|))) |v_#memory_$Pointer$.offset_25|) (= (store |v_#memory_int_19| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8| (store (select |v_#memory_int_19| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| 0)) |v_#memory_int_18|) (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|) (= 1 (select |v_#valid_47| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|))) InVars {ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_26|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_19|, #length=|v_#length_33|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_8|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_26|} OutVars{ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_6|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_25|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_33|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_7|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_25|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~post7.offset, #memory_$Pointer$.base, #memory_int, ULTIMATE.start_cstpncpy_#t~post7.base, #memory_$Pointer$.offset] 1149#L17-2 362.28/278.93 [2019-03-28 12:42:20,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.93 [2019-03-28 12:42:20,346 INFO L82 PathProgramCache]: Analyzing trace with hash 972709021, now seen corresponding path program 2 times 362.28/278.93 [2019-03-28 12:42:20,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.93 [2019-03-28 12:42:20,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.93 [2019-03-28 12:42:20,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:20,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.93 [2019-03-28 12:42:20,373 INFO L82 PathProgramCache]: Analyzing trace with hash 178463, now seen corresponding path program 2 times 362.28/278.93 [2019-03-28 12:42:20,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.93 [2019-03-28 12:42:20,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.93 [2019-03-28 12:42:20,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:20,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.93 [2019-03-28 12:42:20,378 INFO L82 PathProgramCache]: Analyzing trace with hash -169752829, now seen corresponding path program 1 times 362.28/278.93 [2019-03-28 12:42:20,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.93 [2019-03-28 12:42:20,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.93 [2019-03-28 12:42:20,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.28/278.93 [2019-03-28 12:42:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.28/278.93 [2019-03-28 12:42:20,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 362.28/278.93 [2019-03-28 12:42:20,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 362.28/278.93 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 362.28/278.93 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 362.28/278.93 Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 362.28/278.93 [2019-03-28 12:42:20,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.28/278.93 [2019-03-28 12:42:20,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core 362.28/278.93 [2019-03-28 12:42:20,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... 362.28/278.93 [2019-03-28 12:42:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.28/278.93 [2019-03-28 12:42:20,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 362.28/278.93 [2019-03-28 12:42:20,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 362.28/278.93 [2019-03-28 12:42:20,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 362.28/278.93 [2019-03-28 12:42:20,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 362.28/278.93 [2019-03-28 12:42:20,572 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. cyclomatic complexity: 19 Second operand 5 states. 362.28/278.93 [2019-03-28 12:42:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.28/278.93 [2019-03-28 12:42:20,643 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. 362.28/278.93 [2019-03-28 12:42:20,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 362.28/278.93 [2019-03-28 12:42:20,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 69 transitions. 362.28/278.93 [2019-03-28 12:42:20,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 362.28/278.93 [2019-03-28 12:42:20,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 30 states and 38 transitions. 362.28/278.93 [2019-03-28 12:42:20,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 362.28/278.93 [2019-03-28 12:42:20,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 362.28/278.93 [2019-03-28 12:42:20,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. 362.28/278.93 [2019-03-28 12:42:20,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 362.28/278.93 [2019-03-28 12:42:20,649 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. 362.28/278.93 [2019-03-28 12:42:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. 362.28/278.93 [2019-03-28 12:42:20,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. 362.28/278.93 [2019-03-28 12:42:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 362.28/278.93 [2019-03-28 12:42:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. 362.28/278.93 [2019-03-28 12:42:20,651 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. 362.28/278.93 [2019-03-28 12:42:20,651 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. 362.28/278.93 [2019-03-28 12:42:20,651 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 362.28/278.93 [2019-03-28 12:42:20,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. 362.28/278.93 [2019-03-28 12:42:20,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 362.28/278.93 [2019-03-28 12:42:20,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 362.28/278.93 [2019-03-28 12:42:20,652 INFO L119 BuchiIsEmpty]: Starting construction of run 362.28/278.93 [2019-03-28 12:42:20,652 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 362.28/278.93 [2019-03-28 12:42:20,652 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 362.28/278.93 [2019-03-28 12:42:20,654 INFO L794 eck$LassoCheckResult]: Stem: 1324#ULTIMATE.startENTRY [236] ULTIMATE.startENTRY-->L29: Formula: (and (= (store |v_#valid_34| 0 0) |v_#valid_33|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_34|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_#t~ret13.base=|v_ULTIMATE.start_main_#t~ret13.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret13.offset=|v_ULTIMATE.start_main_#t~ret13.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_33|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_#t~ret13.base, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret13.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 1317#L29 [154] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 1314#L29-2 [155] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 1315#L32-1 [185] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2| 1))) (and (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2| 1)) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_2|) 0) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc11.base_2|)) (> 0 |v_ULTIMATE.start_main_#t~malloc12.base_2|) (< |v_ULTIMATE.start_main_#t~malloc12.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc12.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc11.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_2| v_ULTIMATE.start_main_~length~0_7)))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_#t~malloc11.base, #length] 1310#L37 [117] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8 (- 1))) (.cse1 (+ v_ULTIMATE.start_main_~nondetString~0.offset_3 v_ULTIMATE.start_main_~length~0_8))) (and (= |v_#memory_$Pointer$.offset_1| (store |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.offset_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 (select (select |v_#memory_$Pointer$.offset_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0)))) (<= .cse1 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString~0.base_3)) (= (store |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_$Pointer$.base_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 (select (select |v_#memory_$Pointer$.base_1| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0))) |v_#memory_$Pointer$.base_1|) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString~0.base_3) .cse0 0))) (<= 1 .cse1) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString~0.base_3)))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_3, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 1311#L37-1 [191] L37-1-->L5: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#in~dst.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_3) (< |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 0) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1|)) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 8)) (< |v_ULTIMATE.start_cstpncpy_~#dst.base_1| |v_#StackHeapBarrier_2|) (= |v_ULTIMATE.start_cstpncpy_#in~dst.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_3) (= |v_ULTIMATE.start_cstpncpy_#in~n_1| v_ULTIMATE.start_main_~n~0_8) (= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_1|) (= |v_ULTIMATE.start_cstpncpy_#in~src.offset_1| v_ULTIMATE.start_main_~nondetString~0.offset_5) (= (store |v_#valid_9| |v_ULTIMATE.start_cstpncpy_~#dst.base_1| 1) |v_#valid_8|) (= |v_ULTIMATE.start_cstpncpy_#in~src.base_1| v_ULTIMATE.start_main_~nondetString~0.base_6)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, #valid=|v_#valid_9|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, #length=|v_#length_7|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_1, ULTIMATE.start_cstpncpy_#t~mem8.base=|v_ULTIMATE.start_cstpncpy_#t~mem8.base_1|, ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_1|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_1|, ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_1|, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_1|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_1|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_1, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_5, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_1|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_1, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_1, ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_1|, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_1|, ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_1|, #length=|v_#length_6|, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_1|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_1|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_1, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_1|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_1|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_1|, ULTIMATE.start_cstpncpy_#res.base=|v_ULTIMATE.start_cstpncpy_#res.base_1|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_1|, ULTIMATE.start_cstpncpy_#res.offset=|v_ULTIMATE.start_cstpncpy_#res.offset_1|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_1|, ULTIMATE.start_cstpncpy_#t~mem8.offset=|v_ULTIMATE.start_cstpncpy_#t~mem8.offset_1|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_1, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_6, #valid=|v_#valid_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_1|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_1|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_#t~mem8.base, ULTIMATE.start_cstpncpy_#t~post7.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#in~src.offset, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~#dst.offset, ULTIMATE.start_cstpncpy_~src.base, ULTIMATE.start_cstpncpy_#in~dst.base, ULTIMATE.start_cstpncpy_#t~mem5, ULTIMATE.start_cstpncpy_~n, ULTIMATE.start_cstpncpy_~s~0.offset, ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~pre2, #length, ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_#in~n, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_#t~mem1.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#res.base, ULTIMATE.start_cstpncpy_#in~src.base, ULTIMATE.start_cstpncpy_#res.offset, ULTIMATE.start_cstpncpy_~#dst.base, ULTIMATE.start_cstpncpy_#t~mem8.offset, ULTIMATE.start_cstpncpy_~src.offset, ULTIMATE.start_cstpncpy_~d~0.offset, #valid, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#in~dst.offset, ULTIMATE.start_cstpncpy_#t~post7.base] 1312#L5 [237] L5-->L8: Formula: (and (= v_ULTIMATE.start_cstpncpy_~src.offset_4 |v_ULTIMATE.start_cstpncpy_#in~src.offset_3|) (= (store |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|)) |v_#memory_$Pointer$.offset_16|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|) (= (store |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| |v_ULTIMATE.start_cstpncpy_#in~dst.base_3|)) |v_#memory_$Pointer$.base_16|) (= v_ULTIMATE.start_cstpncpy_~src.base_4 |v_ULTIMATE.start_cstpncpy_#in~src.base_3|) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| 8) (select |v_#length_26| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|)) (= v_ULTIMATE.start_cstpncpy_~n_10 |v_ULTIMATE.start_cstpncpy_#in~n_3|) (= 1 (select |v_#valid_35| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|)) (= (store |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23| (store (select |v_#memory_int_15| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17| (select (select |v_#memory_int_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_23|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_17|))) |v_#memory_int_14|)) InVars {ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} OutVars{ULTIMATE.start_cstpncpy_#in~src.offset=|v_ULTIMATE.start_cstpncpy_#in~src.offset_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_16|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_4, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_17|, ULTIMATE.start_cstpncpy_#in~src.base=|v_ULTIMATE.start_cstpncpy_#in~src.base_3|, ULTIMATE.start_cstpncpy_#in~dst.base=|v_ULTIMATE.start_cstpncpy_#in~dst.base_3|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_10, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_23|, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_4, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_cstpncpy_#in~dst.offset=|v_ULTIMATE.start_cstpncpy_#in~dst.offset_3|, #length=|v_#length_26|, ULTIMATE.start_cstpncpy_#in~n=|v_ULTIMATE.start_cstpncpy_#in~n_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~src.offset, #memory_$Pointer$.base, ULTIMATE.start_cstpncpy_~src.base, #memory_int, ULTIMATE.start_cstpncpy_~n, #memory_$Pointer$.offset] 1313#L8 [196] L8-->L9: Formula: (> v_ULTIMATE.start_cstpncpy_~n_3 0) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} OutVars{ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_3} AuxVars[] AssignedVars[] 1318#L9 [239] L9-->L12: Formula: (and (= (select |v_#valid_38| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) 1) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_20| 8) (select |v_#length_28| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|)) (= (select (select |v_#memory_$Pointer$.base_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) v_ULTIMATE.start_cstpncpy_~d~0.base_8) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_8 (select (select |v_#memory_$Pointer$.offset_19| |v_ULTIMATE.start_cstpncpy_~#dst.base_26|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|)) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_20|) (= v_ULTIMATE.start_cstpncpy_~src.offset_5 v_ULTIMATE.start_cstpncpy_~s~0.offset_5) (= v_ULTIMATE.start_cstpncpy_~src.base_5 v_ULTIMATE.start_cstpncpy_~s~0.base_5)) InVars {ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_8, ULTIMATE.start_cstpncpy_#t~mem0.offset=|v_ULTIMATE.start_cstpncpy_#t~mem0.offset_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_19|, ULTIMATE.start_cstpncpy_~src.base=v_ULTIMATE.start_cstpncpy_~src.base_5, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_20|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_26|, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_5, ULTIMATE.start_cstpncpy_~src.offset=v_ULTIMATE.start_cstpncpy_~src.offset_5, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_8, ULTIMATE.start_cstpncpy_#t~mem0.base=|v_ULTIMATE.start_cstpncpy_#t~mem0.base_5|, #valid=|v_#valid_38|, #length=|v_#length_28|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_5, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~mem0.base, ULTIMATE.start_cstpncpy_#t~mem0.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 1323#L12 [141] L12-->L12-1: Formula: (and (= (select (select |v_#memory_$Pointer$.base_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|) (= (select (select |v_#memory_$Pointer$.offset_6| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_7|) (= (select |v_#valid_14| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|) 1) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_7| 8) (select |v_#length_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_9|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_2|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_6|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_7|, #valid=|v_#valid_14|, #length=|v_#length_12|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_6|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, ULTIMATE.start_cstpncpy_#t~mem1.offset] 1326#L12-1 [243] L12-1-->L13-4: Formula: (and (= (store |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_int_17| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (select (select |v_#memory_int_16| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|))) |v_#memory_int_16|) (= |v_#memory_$Pointer$.offset_23| (store |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.offset_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| (+ (mod v_ULTIMATE.start_cstpncpy_~n_11 4294967296) |v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|)))) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| 8) (select |v_#length_32| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (= (store |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33| (store (select |v_#memory_$Pointer$.base_24| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_27| |v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|)) |v_#memory_$Pointer$.base_23|) (= 1 (select |v_#valid_46| |v_ULTIMATE.start_cstpncpy_~#dst.base_33|)) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_27|)) InVars {ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_6|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_24|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_24|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_6|} OutVars{ULTIMATE.start_cstpncpy_#t~mem1.base=|v_ULTIMATE.start_cstpncpy_#t~mem1.base_5|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_23|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_27|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_16|, #length=|v_#length_32|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_11, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_33|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_23|, ULTIMATE.start_cstpncpy_#t~mem1.offset=|v_ULTIMATE.start_cstpncpy_#t~mem1.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem1.base, #memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset, ULTIMATE.start_cstpncpy_#t~mem1.offset] 1319#L13-4 [134] L13-4-->L14: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| v_ULTIMATE.start_cstpncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| v_ULTIMATE.start_cstpncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| 1)) (= |v_ULTIMATE.start_cstpncpy_#t~post3.base_2| v_ULTIMATE.start_cstpncpy_~d~0.base_4) (= v_ULTIMATE.start_cstpncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| 1)) (= v_ULTIMATE.start_cstpncpy_~s~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post4.base_2|) (= v_ULTIMATE.start_cstpncpy_~d~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post3.base_2|) (= |v_ULTIMATE.start_cstpncpy_#t~post4.base_2| v_ULTIMATE.start_cstpncpy_~s~0.base_4)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_4, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_4, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_4, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_4} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_3, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_2|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_2|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_2|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_2|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_3, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 1320#L14 [111] L14-->L14-1: Formula: (and (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) (= (select |v_#valid_18| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) 1) (= (select (select |v_#memory_int_7| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) |v_ULTIMATE.start_cstpncpy_#t~mem5_2|) (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_16|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_2|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem5] 1331#L14-1 [107] L14-1-->L14-2: Formula: (and (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| 1) (select |v_#length_18| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (= (store |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.base_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.base_9|) (= (store |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.offset_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.offset_9|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|) (= |v_#memory_int_8| (store |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| |v_ULTIMATE.start_cstpncpy_#t~mem5_3|)))) InVars {ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_10|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_10|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_9|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 1329#L14-2 [223] L14-2-->L13-1: Formula: (> 0 |v_ULTIMATE.start_cstpncpy_#t~mem5_7|) InVars {ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_7|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_6|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_6|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_6|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_7|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#t~mem5] 1327#L13-1 [153] L13-1-->L13-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstpncpy_~n_8 (- 1)))) (and (= |v_ULTIMATE.start_cstpncpy_#t~pre2_2| .cse0) (= v_ULTIMATE.start_cstpncpy_~n_7 .cse0))) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_8} OutVars{ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_2|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_7} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre2, ULTIMATE.start_cstpncpy_~n] 1325#L13-2 [228] L13-2-->L13-4: Formula: (< 0 |v_ULTIMATE.start_cstpncpy_#t~pre2_6|) InVars {ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_6|} OutVars{ULTIMATE.start_cstpncpy_#t~pre2=|v_ULTIMATE.start_cstpncpy_#t~pre2_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre2] 1321#L13-4 [134] L13-4-->L14: Formula: (and (= |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| v_ULTIMATE.start_cstpncpy_~d~0.offset_4) (= |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| v_ULTIMATE.start_cstpncpy_~s~0.offset_4) (= v_ULTIMATE.start_cstpncpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_2| 1)) (= |v_ULTIMATE.start_cstpncpy_#t~post3.base_2| v_ULTIMATE.start_cstpncpy_~d~0.base_4) (= v_ULTIMATE.start_cstpncpy_~s~0.offset_3 (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_2| 1)) (= v_ULTIMATE.start_cstpncpy_~s~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post4.base_2|) (= v_ULTIMATE.start_cstpncpy_~d~0.base_3 |v_ULTIMATE.start_cstpncpy_#t~post3.base_2|) (= |v_ULTIMATE.start_cstpncpy_#t~post4.base_2| v_ULTIMATE.start_cstpncpy_~s~0.base_4)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_4, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_4, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_4, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_4} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_3, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_3, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_2|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_2|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_2|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_2|, ULTIMATE.start_cstpncpy_~s~0.base=v_ULTIMATE.start_cstpncpy_~s~0.base_3, ULTIMATE.start_cstpncpy_~s~0.offset=v_ULTIMATE.start_cstpncpy_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_~s~0.base, ULTIMATE.start_cstpncpy_~s~0.offset] 1322#L14 [111] L14-->L14-1: Formula: (and (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) (= (select |v_#valid_18| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) 1) (= (select (select |v_#memory_int_7| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|) |v_ULTIMATE.start_cstpncpy_#t~mem5_2|) (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post4.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstpncpy_#t~post4.base_3|))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_16|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_3|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_3|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_2|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~mem5] 1330#L14-1 [107] L14-1-->L14-2: Formula: (and (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| 1) (select |v_#length_18| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (= (store |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.base_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.base_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.base_9|) (= (store |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_$Pointer$.offset_10| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| (select (select |v_#memory_$Pointer$.offset_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|))) |v_#memory_$Pointer$.offset_9|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|)) (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|) (= |v_#memory_int_8| (store |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_cstpncpy_#t~post3.base_3|) |v_ULTIMATE.start_cstpncpy_#t~post3.offset_3| |v_ULTIMATE.start_cstpncpy_#t~mem5_3|)))) InVars {ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_10|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_10|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_3|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_3|, #length=|v_#length_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_9|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 1328#L14-2 [105] L14-2-->L15: Formula: (= 0 |v_ULTIMATE.start_cstpncpy_#t~mem5_5|) InVars {ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_5|} OutVars{ULTIMATE.start_cstpncpy_#t~post3.offset=|v_ULTIMATE.start_cstpncpy_#t~post3.offset_5|, ULTIMATE.start_cstpncpy_#t~mem5=|v_ULTIMATE.start_cstpncpy_#t~mem5_4|, ULTIMATE.start_cstpncpy_#t~post3.base=|v_ULTIMATE.start_cstpncpy_#t~post3.base_6|, ULTIMATE.start_cstpncpy_#t~post4.base=|v_ULTIMATE.start_cstpncpy_#t~post4.base_6|, ULTIMATE.start_cstpncpy_#t~post4.offset=|v_ULTIMATE.start_cstpncpy_#t~post4.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~post3.base, ULTIMATE.start_cstpncpy_#t~post4.base, ULTIMATE.start_cstpncpy_#t~post4.offset, ULTIMATE.start_cstpncpy_#t~post3.offset, ULTIMATE.start_cstpncpy_#t~mem5] 1307#L15 [114] L15-->L17-2: Formula: (and (= 1 (select |v_#valid_22| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|)) (= |v_#memory_$Pointer$.base_11| (store |v_#memory_$Pointer$.base_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_15| (store (select |v_#memory_$Pointer$.base_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_11| v_ULTIMATE.start_cstpncpy_~d~0.base_5))) (<= 0 |v_ULTIMATE.start_cstpncpy_~#dst.offset_11|) (= (store |v_#memory_$Pointer$.offset_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_15| (store (select |v_#memory_$Pointer$.offset_12| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_11| (+ v_ULTIMATE.start_cstpncpy_~d~0.offset_5 (- 1)))) |v_#memory_$Pointer$.offset_11|) (<= (+ |v_ULTIMATE.start_cstpncpy_~#dst.offset_11| 8) (select |v_#length_20| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|)) (= (store |v_#memory_int_11| |v_ULTIMATE.start_cstpncpy_~#dst.base_15| (store (select |v_#memory_int_11| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_11| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstpncpy_~#dst.base_15|) |v_ULTIMATE.start_cstpncpy_~#dst.offset_11|))) |v_#memory_int_10|)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_5, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_5, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_12|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_11|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_15|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_12|} OutVars{ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_5, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_5, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_11|, ULTIMATE.start_cstpncpy_~#dst.offset=|v_ULTIMATE.start_cstpncpy_~#dst.offset_11|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_20|, ULTIMATE.start_cstpncpy_~#dst.base=|v_ULTIMATE.start_cstpncpy_~#dst.base_15|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_11|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] 1308#L17-2 362.28/278.93 [2019-03-28 12:42:20,654 INFO L796 eck$LassoCheckResult]: Loop: 1308#L17-2 [147] L17-2-->L17: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstpncpy_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstpncpy_~n_5 .cse0) (= |v_ULTIMATE.start_cstpncpy_#t~pre6_2| .cse0))) InVars {ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_6} OutVars{ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_2|, ULTIMATE.start_cstpncpy_~n=v_ULTIMATE.start_cstpncpy_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_~n] 1309#L17 [231] L17-->L18: Formula: (and (= v_ULTIMATE.start_cstpncpy_~d~0.offset_6 (+ |v_ULTIMATE.start_cstpncpy_#t~post7.offset_2| 1)) (= |v_ULTIMATE.start_cstpncpy_#t~post7.base_2| v_ULTIMATE.start_cstpncpy_~d~0.base_7) (= v_ULTIMATE.start_cstpncpy_~d~0.base_6 |v_ULTIMATE.start_cstpncpy_#t~post7.base_2|) (> 0 |v_ULTIMATE.start_cstpncpy_#t~pre6_6|) (= |v_ULTIMATE.start_cstpncpy_#t~post7.offset_2| v_ULTIMATE.start_cstpncpy_~d~0.offset_7)) InVars {ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_7, ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_7, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_6|} OutVars{ULTIMATE.start_cstpncpy_~d~0.offset=v_ULTIMATE.start_cstpncpy_~d~0.offset_6, ULTIMATE.start_cstpncpy_~d~0.base=v_ULTIMATE.start_cstpncpy_~d~0.base_6, ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_2|, ULTIMATE.start_cstpncpy_#t~pre6=|v_ULTIMATE.start_cstpncpy_#t~pre6_5|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_~d~0.offset, ULTIMATE.start_cstpncpy_~d~0.base, ULTIMATE.start_cstpncpy_#t~post7.offset, ULTIMATE.start_cstpncpy_#t~pre6, ULTIMATE.start_cstpncpy_#t~post7.base] 1316#L18 [244] L18-->L17-2: Formula: (and (= (store |v_#memory_$Pointer$.base_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8| (store (select |v_#memory_$Pointer$.base_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| (select (select |v_#memory_$Pointer$.base_25| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|))) |v_#memory_$Pointer$.base_25|) (<= (+ |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| 1) (select |v_#length_33| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|)) (= (store |v_#memory_$Pointer$.offset_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8| (store (select |v_#memory_$Pointer$.offset_26| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| (select (select |v_#memory_$Pointer$.offset_25| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|))) |v_#memory_$Pointer$.offset_25|) (= (store |v_#memory_int_19| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8| (store (select |v_#memory_int_19| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|) |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7| 0)) |v_#memory_int_18|) (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|) (= 1 (select |v_#valid_47| |v_ULTIMATE.start_cstpncpy_#t~post7.base_8|))) InVars {ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_7|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_26|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_19|, #length=|v_#length_33|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_8|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_26|} OutVars{ULTIMATE.start_cstpncpy_#t~post7.offset=|v_ULTIMATE.start_cstpncpy_#t~post7.offset_6|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_25|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_33|, ULTIMATE.start_cstpncpy_#t~post7.base=|v_ULTIMATE.start_cstpncpy_#t~post7.base_7|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_25|} AuxVars[] AssignedVars[ULTIMATE.start_cstpncpy_#t~post7.offset, #memory_$Pointer$.base, #memory_int, ULTIMATE.start_cstpncpy_#t~post7.base, #memory_$Pointer$.offset] 1308#L17-2 362.28/278.93 [2019-03-28 12:42:20,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.93 [2019-03-28 12:42:20,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1802640220, now seen corresponding path program 1 times 362.28/278.93 [2019-03-28 12:42:20,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.93 [2019-03-28 12:42:20,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.93 [2019-03-28 12:42:20,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:20,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.93 [2019-03-28 12:42:20,681 INFO L82 PathProgramCache]: Analyzing trace with hash 178463, now seen corresponding path program 3 times 362.28/278.93 [2019-03-28 12:42:20,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.93 [2019-03-28 12:42:20,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.93 [2019-03-28 12:42:20,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 362.28/278.93 [2019-03-28 12:42:20,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 362.28/278.93 [2019-03-28 12:42:20,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1816126492, now seen corresponding path program 1 times 362.28/278.93 [2019-03-28 12:42:20,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 362.28/278.93 [2019-03-28 12:42:20,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 362.28/278.93 [2019-03-28 12:42:20,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 362.28/278.93 [2019-03-28 12:42:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 362.28/278.93 [2019-03-28 12:42:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 362.28/278.93 [2019-03-28 12:42:20,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 362.28/278.93 [2019-03-28 12:42:20,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 362.28/278.93 [2019-03-28 12:42:20,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 362.28/278.93 [2019-03-28 12:42:20,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 362.28/278.93 [2019-03-28 12:42:20,792 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 9 Second operand 5 states. 362.28/278.93 [2019-03-28 12:42:20,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 362.28/278.93 [2019-03-28 12:42:20,836 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. 362.28/278.93 [2019-03-28 12:42:20,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 362.28/278.93 [2019-03-28 12:42:20,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. 362.28/278.93 [2019-03-28 12:42:20,841 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 362.28/278.93 [2019-03-28 12:42:20,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. 362.28/278.93 [2019-03-28 12:42:20,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 362.28/278.93 [2019-03-28 12:42:20,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 362.28/278.93 [2019-03-28 12:42:20,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 362.28/278.93 [2019-03-28 12:42:20,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 362.28/278.93 [2019-03-28 12:42:20,841 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 362.28/278.93 [2019-03-28 12:42:20,841 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 362.28/278.93 [2019-03-28 12:42:20,841 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 362.28/278.93 [2019-03-28 12:42:20,842 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 362.28/278.93 [2019-03-28 12:42:20,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 362.28/278.93 [2019-03-28 12:42:20,842 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 362.28/278.93 [2019-03-28 12:42:20,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 362.28/278.93 [2019-03-28 12:42:20,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:42:20 BasicIcfg 362.28/278.93 [2019-03-28 12:42:20,848 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 362.28/278.93 [2019-03-28 12:42:20,848 INFO L168 Benchmark]: Toolchain (without parser) took 274456.90 ms. Allocated memory was 649.6 MB in the beginning and 1.1 GB in the end (delta: 473.4 MB). Free memory was 565.0 MB in the beginning and 593.4 MB in the end (delta: -28.4 MB). Peak memory consumption was 445.0 MB. Max. memory is 50.3 GB. 362.28/278.93 [2019-03-28 12:42:20,849 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 362.28/278.93 [2019-03-28 12:42:20,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.37 ms. Allocated memory was 649.6 MB in the beginning and 667.4 MB in the end (delta: 17.8 MB). Free memory was 565.0 MB in the beginning and 634.6 MB in the end (delta: -69.6 MB). Peak memory consumption was 33.2 MB. Max. memory is 50.3 GB. 362.28/278.93 [2019-03-28 12:42:20,849 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.41 ms. Allocated memory is still 667.4 MB. Free memory was 634.6 MB in the beginning and 630.1 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 50.3 GB. 362.28/278.93 [2019-03-28 12:42:20,850 INFO L168 Benchmark]: Boogie Preprocessor took 29.68 ms. Allocated memory is still 667.4 MB. Free memory was 630.1 MB in the beginning and 628.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 362.28/278.93 [2019-03-28 12:42:20,850 INFO L168 Benchmark]: RCFGBuilder took 394.96 ms. Allocated memory is still 667.4 MB. Free memory was 628.8 MB in the beginning and 598.5 MB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. 362.28/278.93 [2019-03-28 12:42:20,850 INFO L168 Benchmark]: BlockEncodingV2 took 140.77 ms. Allocated memory is still 667.4 MB. Free memory was 598.5 MB in the beginning and 586.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 362.28/278.93 [2019-03-28 12:42:20,850 INFO L168 Benchmark]: TraceAbstraction took 246780.40 ms. Allocated memory was 667.4 MB in the beginning and 1.2 GB in the end (delta: 533.7 MB). Free memory was 585.0 MB in the beginning and 410.1 MB in the end (delta: 174.9 MB). Peak memory consumption was 980.6 MB. Max. memory is 50.3 GB. 362.28/278.93 [2019-03-28 12:42:20,851 INFO L168 Benchmark]: BuchiAutomizer took 26750.69 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -78.1 MB). Free memory was 410.1 MB in the beginning and 593.4 MB in the end (delta: -183.3 MB). There was no memory consumed. Max. memory is 50.3 GB. 362.28/278.93 [2019-03-28 12:42:20,852 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 362.28/278.93 --- Results --- 362.28/278.93 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 362.28/278.93 - StatisticsResult: Initial Icfg 362.28/278.93 52 locations, 59 edges 362.28/278.93 - StatisticsResult: Encoded RCFG 362.28/278.93 42 locations, 75 edges 362.28/278.93 * Results from de.uni_freiburg.informatik.ultimate.core: 362.28/278.93 - StatisticsResult: Toolchain Benchmarks 362.28/278.93 Benchmark results are: 362.28/278.93 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 362.28/278.93 * CACSL2BoogieTranslator took 310.37 ms. Allocated memory was 649.6 MB in the beginning and 667.4 MB in the end (delta: 17.8 MB). Free memory was 565.0 MB in the beginning and 634.6 MB in the end (delta: -69.6 MB). Peak memory consumption was 33.2 MB. Max. memory is 50.3 GB. 362.28/278.93 * Boogie Procedure Inliner took 44.41 ms. Allocated memory is still 667.4 MB. Free memory was 634.6 MB in the beginning and 630.1 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 50.3 GB. 362.28/278.93 * Boogie Preprocessor took 29.68 ms. Allocated memory is still 667.4 MB. Free memory was 630.1 MB in the beginning and 628.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 362.28/278.93 * RCFGBuilder took 394.96 ms. Allocated memory is still 667.4 MB. Free memory was 628.8 MB in the beginning and 598.5 MB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. 362.28/278.93 * BlockEncodingV2 took 140.77 ms. Allocated memory is still 667.4 MB. Free memory was 598.5 MB in the beginning and 586.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 362.28/278.93 * TraceAbstraction took 246780.40 ms. Allocated memory was 667.4 MB in the beginning and 1.2 GB in the end (delta: 533.7 MB). Free memory was 585.0 MB in the beginning and 410.1 MB in the end (delta: 174.9 MB). Peak memory consumption was 980.6 MB. Max. memory is 50.3 GB. 362.28/278.93 * BuchiAutomizer took 26750.69 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -78.1 MB). Free memory was 410.1 MB in the beginning and 593.4 MB in the end (delta: -183.3 MB). There was no memory consumed. Max. memory is 50.3 GB. 362.28/278.93 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_cstpncpy_~#dst.base,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_cstpncpy_~#dst.base,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_cstpncpy_~#dst.base,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_cstpncpy_~#dst.base,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.93 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_$Pointer$ 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_$Pointer$ 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_$Pointer$ 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_$Pointer$ 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_$Pointer$ 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_$Pointer$ 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #memory_int 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.93 unknown boogie variable #length 362.28/278.93 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_$Pointer$ 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_$Pointer$ 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #memory_int 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 - GenericResult: Unfinished Backtranslation 362.28/278.94 unknown boogie variable #length 362.28/278.94 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 362.28/278.94 - PositiveResult [Line: 37]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - PositiveResult [Line: 14]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - PositiveResult [Line: 37]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - PositiveResult [Line: 14]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - PositiveResult [Line: 5]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - PositiveResult [Line: 14]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - PositiveResult [Line: 23]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - PositiveResult [Line: 12]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - PositiveResult [Line: 12]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - PositiveResult [Line: 14]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - PositiveResult [Line: 18]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - PositiveResult [Line: 18]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - PositiveResult [Line: 12]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - PositiveResult [Line: 12]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - PositiveResult [Line: 23]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - PositiveResult [Line: 5]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - PositiveResult [Line: 15]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - PositiveResult [Line: 9]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - PositiveResult [Line: 15]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - PositiveResult [Line: 9]: pointer dereference always succeeds 362.28/278.94 For all program executions holds that pointer dereference always succeeds at this location 362.28/278.94 - AllSpecificationsHoldResult: All specifications hold 362.28/278.94 20 specifications checked. All of them hold 362.28/278.94 - InvariantResult [Line: 15]: Loop Invariant 362.28/278.94 [2019-03-28 12:42:20,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,867 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,867 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,867 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,867 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,869 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,869 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,869 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,877 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 Derived loop invariant: (n + d <= unknown-#length-unknown[d] + 1 && ((n == unknown-#length-unknown[nondetArea] && (((!(nondetString == nondetArea) && (((((((((((((((((((((((((0 <= src && length == unknown-#length-unknown[nondetString]) && 0 <= dst) && 0 <= dst) && 1 <= n) && 0 <= src) && \valid[nondetArea] == 1) && nondetString == 0) && \valid[dst] == 1) && \valid[s] == 1) && \valid[src] == 1) && 8 == unknown-#length-unknown[dst]) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[d]) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[src]) && 0 <= s) && dst <= 0) && \valid[dst] == 1) && nondetArea == nondetString) && \valid[nondetString] == 1) && 0 <= d) && 1 <= d) && \old(n) + dst <= unknown-#length-unknown[dst]) && 1 <= \old(n)) && (length + nondetString == 1 || (1 <= length && length == unknown-#length-unknown[nondetString]))) && 1 <= n) && !(dst == s)) && !(d == s)) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + ULTIMATE.start_main_~nondetString~0.offset + -1] && ULTIMATE.start_main_~nondetString~0.offset <= 0) && 0 <= ULTIMATE.start_main_~nondetString~0.offset)) && !(dst == dst)) && dst <= 0) || ((((1 <= \old(n) && 1 <= d && ((((((((((((((((((((((((0 <= src && length == unknown-#length-unknown[nondetString]) && 0 <= dst) && 0 <= dst) && 1 <= n) && 0 <= src) && \valid[nondetArea] == 1) && nondetString == 0) && \valid[dst] == 1) && \valid[s] == 1) && \valid[src] == 1) && 8 == unknown-#length-unknown[dst]) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[d]) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[src]) && 0 <= s) && dst <= 0) && \valid[dst] == 1) && nondetArea == nondetString) && \valid[nondetString] == 1) && 0 <= d) && n == unknown-#length-unknown[nondetArea]) && \old(n) + dst <= unknown-#length-unknown[dst]) && nondetArea + 1 <= 0) && n + d <= unknown-#length-unknown[d] + 1) && (length + nondetString == 1 || (1 <= length && length == unknown-#length-unknown[nondetString]))) && dst <= 0) && 1 <= n) 362.28/278.94 - InvariantResult [Line: 13]: Loop Invariant 362.28/278.94 [2019-03-28 12:42:20,878 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.94 [2019-03-28 12:42:20,879 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,879 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,879 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,881 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,881 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,881 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,882 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,882 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,882 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,882 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,884 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,884 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,884 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,884 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,885 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,885 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,885 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,885 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,885 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,886 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.94 [2019-03-28 12:42:20,886 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,886 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,887 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,887 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,887 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,887 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,888 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,888 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,888 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,888 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,888 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,889 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,889 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,889 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,890 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,890 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,890 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,890 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,891 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.94 [2019-03-28 12:42:20,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_cstpncpy_~#dst.base,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_cstpncpy_~#dst.base,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,896 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,896 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,896 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.94 [2019-03-28 12:42:20,897 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,897 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,897 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,897 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,898 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,898 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,898 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,898 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,898 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,899 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,899 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,899 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,899 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,900 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,900 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ 362.28/278.94 [2019-03-28 12:42:20,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,907 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,907 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,907 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,907 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,910 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,910 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,910 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,910 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ 362.28/278.94 [2019-03-28 12:42:20,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,915 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,916 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,918 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,918 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ 362.28/278.94 [2019-03-28 12:42:20,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,921 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,925 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ 362.28/278.94 [2019-03-28 12:42:20,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,930 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,934 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,936 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.94 [2019-03-28 12:42:20,936 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,937 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,937 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,937 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,938 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,938 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,938 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,940 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,940 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,940 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,941 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,941 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,941 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,941 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,942 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,942 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,942 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,942 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,942 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,943 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,943 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,943 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,943 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,943 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.94 [2019-03-28 12:42:20,944 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,944 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,944 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,945 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,945 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,945 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,945 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,946 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,946 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,946 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,946 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,946 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,947 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,947 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,947 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,947 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,948 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,948 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,948 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.94 [2019-03-28 12:42:20,949 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,949 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,949 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,949 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,950 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,950 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,950 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,951 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,951 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,951 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,951 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_cstpncpy_~#dst.base,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_cstpncpy_~#dst.base,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,954 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset 362.28/278.94 [2019-03-28 12:42:20,954 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,955 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,955 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,955 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,955 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,955 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 362.28/278.94 [2019-03-28 12:42:20,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,960 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,960 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,961 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,961 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ 362.28/278.94 [2019-03-28 12:42:20,961 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,962 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,962 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,963 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,963 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,963 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,964 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,964 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,964 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,966 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,966 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,966 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,967 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,967 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,967 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,967 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ 362.28/278.94 [2019-03-28 12:42:20,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,972 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,972 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,972 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,972 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ 362.28/278.94 [2019-03-28 12:42:20,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ 362.28/278.94 [2019-03-28 12:42:20,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 362.28/278.94 [2019-03-28 12:42:20,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 [2019-03-28 12:42:20,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 362.28/278.94 Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((!(src == dst) && (n + d <= unknown-#length-unknown[d] || (d <= 0 && dst == d))) && 0 <= src) && length == unknown-#length-unknown[nondetString]) && 0 <= dst) && 1 <= n) && 0 <= src) && 0 <= unknown-#memory_int-unknown[src][src]) && nondetString == 0) && \valid[dst] == 1) && !(dst == s)) && unknown-#memory_int-unknown[src][src] <= 0) && \valid[s] == 1) && 0 <= #memory_$Pointer$[dst][dst]) && 1 == \valid[src]) && 0 <= unknown-#memory_int-unknown[src][src]) && !(src == dst)) && nondetArea == nondetString) && \valid[nondetString] == 1) && 0 <= d) && 0 <= dst) && \valid[nondetArea] == 1) && 1 <= \old(n)) && length + nondetString == 1) && (unknown-#memory_int-unknown[nondetString][nondetString] == nondetString || 2 <= unknown-#length-unknown[nondetString] + nondetString)) && unknown-#memory_int-unknown[src][src] <= 0) && \valid[src] == 1) && 8 == unknown-#length-unknown[dst]) && 1 == \valid[d]) && (\exists v_prenex_1 : int :: (unknown-#memory_int-unknown[src][v_prenex_1] == 0 && v_prenex_1 + 1 <= unknown-#length-unknown[src]) && src <= v_prenex_1)) && 0 <= s) && dst <= 0) && (\valid[dst] == 1 || dst == dst)) && unknown-#memory_int-unknown[s][s] <= 0) && (\exists v_prenex_1 : int :: (v_prenex_1 + 1 <= unknown-#length-unknown[src] && src <= v_prenex_1) && 0 == unknown-#memory_int-unknown[src][v_prenex_1])) && (\exists ULTIMATE.start_main_~length~0 : int, ULTIMATE.start_main_~nondetString~0.offset : int :: ((unknown-#memory_int-unknown[s][ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset + -1] == 0 && 1 <= ULTIMATE.start_main_~length~0) && s <= ULTIMATE.start_main_~nondetString~0.offset) && ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset <= unknown-#length-unknown[s])) && 0 <= unknown-#memory_int-unknown[s][s]) && 1 <= n) && !(nondetString == nondetArea)) && (s <= 0 || s + 3 <= unknown-#length-unknown[s])) && !(d == s)) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + ULTIMATE.start_main_~nondetString~0.offset + -1] && ULTIMATE.start_main_~nondetString~0.offset <= 0) && 0 <= ULTIMATE.start_main_~nondetString~0.offset)) && ((src + 3 <= unknown-#length-unknown[src] || src <= 0) || unknown-#length-unknown[src] <= 1)) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (ULTIMATE.start_main_~nondetString~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString~0.offset) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + ULTIMATE.start_main_~nondetString~0.offset + -1])) && !(src == dst)) && n == unknown-#length-unknown[nondetArea]) && 1 <= nondetArea) && \old(n) <= unknown-#length-unknown[dst]) && 0 < dst) && dst < 0) && dst <= 0) && 0 < d) || (((((((((((d + 1 <= 0 && 0 < src) && 0 < s) && (s <= 0 || s + 3 <= unknown-#length-unknown[s])) && 0 < nondetString) && ((src + 3 <= unknown-#length-unknown[src] || src <= 0) || unknown-#length-unknown[src] <= 1)) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (ULTIMATE.start_main_~nondetString~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString~0.offset) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + ULTIMATE.start_main_~nondetString~0.offset + -1])) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (ULTIMATE.start_main_~nondetString~0.offset <= 0 && 0 == unknown-#memory_int-unknown[nondetString][unknown-#length-unknown[nondetString] + ULTIMATE.start_main_~nondetString~0.offset + -1]) && 0 <= ULTIMATE.start_main_~nondetString~0.offset)) && !(src == dst)) && dst + 1 <= 0) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + ULTIMATE.start_main_~nondetString~0.offset + -1] && ULTIMATE.start_main_~nondetString~0.offset <= 0) && 0 <= ULTIMATE.start_main_~nondetString~0.offset)) && 1 <= n && (((((((((((((((((((((((((((((((!(src == dst) && 0 <= src) && length == unknown-#length-unknown[nondetString]) && 0 <= dst) && 0 <= dst) && 1 <= n) && 0 <= src) && \valid[nondetArea] == 1) && 1 <= \old(n)) && nondetArea + 1 <= 0) && nondetString == 0) && \valid[dst] == 1) && \old(n) + dst <= unknown-#length-unknown[dst]) && !(dst == s)) && \valid[s] == 1) && \valid[src] == 1) && 8 == unknown-#length-unknown[dst]) && 1 == \valid[d]) && 0 <= #memory_$Pointer$[dst][dst]) && n == unknown-#length-unknown[nondetArea]) && (\exists v_prenex_1 : int :: (unknown-#memory_int-unknown[src][v_prenex_1] == 0 && v_prenex_1 + 1 <= unknown-#length-unknown[src]) && src <= v_prenex_1)) && 1 == \valid[src]) && n + d <= unknown-#length-unknown[d]) && 0 <= s) && dst <= 0) && (\valid[dst] == 1 || dst == dst)) && (\exists v_prenex_1 : int :: (v_prenex_1 + 1 <= unknown-#length-unknown[src] && src <= v_prenex_1) && 0 == unknown-#memory_int-unknown[src][v_prenex_1])) && (\exists ULTIMATE.start_main_~length~0 : int, ULTIMATE.start_main_~nondetString~0.offset : int :: ((unknown-#memory_int-unknown[s][ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset + -1] == 0 && 1 <= ULTIMATE.start_main_~length~0) && s <= ULTIMATE.start_main_~nondetString~0.offset) && ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset <= unknown-#length-unknown[s])) && nondetArea == nondetString) && \valid[nondetString] == 1) && 0 <= d) && (length + nondetString == 1 || (1 <= length && length == unknown-#length-unknown[nondetString]))) && dst <= 0)) || (((((s <= 0 && !(src == dst)) && (((n == unknown-#length-unknown[nondetArea] && n <= unknown-#length-unknown[d]) && ((((((\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (ULTIMATE.start_main_~nondetString~0.offset <= 0 && 0 == unknown-#memory_int-unknown[nondetString][unknown-#length-unknown[nondetString] + ULTIMATE.start_main_~nondetString~0.offset + -1]) && 0 <= ULTIMATE.start_main_~nondetString~0.offset) && !(nondetString == nondetArea)) && !(d == s)) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + ULTIMATE.start_main_~nondetString~0.offset + -1] && ULTIMATE.start_main_~nondetString~0.offset <= 0) && 0 <= ULTIMATE.start_main_~nondetString~0.offset)) && ((((((((((((((((((((((((((((!(src == dst) && (n + d <= unknown-#length-unknown[d] || (d <= 0 && dst == d))) && 0 <= src) && length == unknown-#length-unknown[nondetString]) && 0 <= dst) && 0 <= dst) && 1 <= n) && 0 <= src) && \valid[nondetArea] == 1) && 1 <= \old(n)) && nondetString == 0) && \valid[dst] == 1) && !(dst == s)) && \valid[s] == 1) && \valid[src] == 1) && 8 == unknown-#length-unknown[dst]) && 1 == \valid[d]) && 0 <= #memory_$Pointer$[dst][dst]) && (\exists v_prenex_1 : int :: (unknown-#memory_int-unknown[src][v_prenex_1] == 0 && v_prenex_1 + 1 <= unknown-#length-unknown[src]) && src <= v_prenex_1)) && 1 == \valid[src]) && 0 <= s) && dst <= 0) && (\valid[dst] == 1 || dst == dst)) && (\exists v_prenex_1 : int :: (v_prenex_1 + 1 <= unknown-#length-unknown[src] && src <= v_prenex_1) && 0 == unknown-#memory_int-unknown[src][v_prenex_1])) && (\exists ULTIMATE.start_main_~length~0 : int, ULTIMATE.start_main_~nondetString~0.offset : int :: ((unknown-#memory_int-unknown[s][ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset + -1] == 0 && 1 <= ULTIMATE.start_main_~length~0) && s <= ULTIMATE.start_main_~nondetString~0.offset) && ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset <= unknown-#length-unknown[s])) && nondetArea == nondetString) && \valid[nondetString] == 1) && 0 <= d) && (length + nondetString == 1 || (1 <= length && length == unknown-#length-unknown[nondetString]))) && 1 <= n) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (ULTIMATE.start_main_~nondetString~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString~0.offset) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + ULTIMATE.start_main_~nondetString~0.offset + -1])) && !(src == dst)) && !(dst == dst)) && \old(n) <= unknown-#length-unknown[dst]) && src <= 0) && dst <= 0) && (\exists ULTIMATE.start_cstpncpy_~#dst.base : int :: !(ULTIMATE.start_cstpncpy_~#dst.base == d) && 8 == unknown-#length-unknown[ULTIMATE.start_cstpncpy_~#dst.base]))) || ((((((((d + 1 <= 0 && 0 < src) && dst + 1 <= 0) && 0 < s) && unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1] == 0) && 0 < nondetString) && (((!(dst == s) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + ULTIMATE.start_main_~nondetString~0.offset + -1] && ULTIMATE.start_main_~nondetString~0.offset <= 0) && 0 <= ULTIMATE.start_main_~nondetString~0.offset)) && 1 <= n) && (((((((((((((((((((((((((((0 <= src && length == unknown-#length-unknown[nondetString]) && 0 <= dst) && 0 <= dst) && 1 <= n) && 0 <= src) && \valid[nondetArea] == 1) && 1 <= \old(n)) && nondetArea + 1 <= 0) && nondetString == 0) && \valid[dst] == 1) && \old(n) + dst <= unknown-#length-unknown[dst]) && \valid[s] == 1) && \valid[src] == 1) && 8 == unknown-#length-unknown[dst]) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[d]) && n == unknown-#length-unknown[nondetArea]) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[src]) && 0 <= s) && dst <= 0) && n + d <= unknown-#length-unknown[d]) && (\valid[dst] == 1 || dst == dst)) && (1 < length || length == 1)) && nondetArea == nondetString) && 1 <= d) && \valid[nondetString] == 1) && dst <= 0) && s + 1 <= unknown-#length-unknown[s]) && unknown-#memory_int-unknown[nondetString][unknown-#length-unknown[nondetString] + -1] == 0) && ((src + 3 <= unknown-#length-unknown[src] || src <= 0) || unknown-#length-unknown[src] <= 1))) || ((((((((((((((((((((((((((((((((((((((((((!(src == dst) && 0 <= src) && length == unknown-#length-unknown[nondetString]) && 0 <= dst) && 1 <= n) && 0 <= src) && 0 <= unknown-#memory_int-unknown[src][src]) && nondetArea + 1 <= 0) && nondetString == 0) && \valid[dst] == 1) && !(dst == s)) && unknown-#memory_int-unknown[src][src] <= 0) && \valid[s] == 1) && 0 <= #memory_$Pointer$[dst][dst]) && 1 == \valid[src]) && 0 <= unknown-#memory_int-unknown[src][src]) && !(src == dst)) && nondetArea == nondetString) && \valid[nondetString] == 1) && 0 <= d) && 0 <= dst) && \valid[nondetArea] == 1) && 1 <= \old(n)) && length + nondetString == 1) && \old(n) + dst <= unknown-#length-unknown[dst]) && (unknown-#memory_int-unknown[nondetString][nondetString] == nondetString || 2 <= unknown-#length-unknown[nondetString] + nondetString)) && unknown-#memory_int-unknown[src][src] <= 0) && \valid[src] == 1) && 8 == unknown-#length-unknown[dst]) && 1 == \valid[d]) && n == unknown-#length-unknown[nondetArea]) && (\exists v_prenex_1 : int :: (unknown-#memory_int-unknown[src][v_prenex_1] == 0 && v_prenex_1 + 1 <= unknown-#length-unknown[src]) && src <= v_prenex_1)) && n + d <= unknown-#length-unknown[d]) && 0 <= s) && dst <= 0) && (\valid[dst] == 1 || dst == dst)) && unknown-#memory_int-unknown[s][s] <= 0) && (\exists v_prenex_1 : int :: (v_prenex_1 + 1 <= unknown-#length-unknown[src] && src <= v_prenex_1) && 0 == unknown-#memory_int-unknown[src][v_prenex_1])) && (\exists ULTIMATE.start_main_~length~0 : int, ULTIMATE.start_main_~nondetString~0.offset : int :: ((unknown-#memory_int-unknown[s][ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset + -1] == 0 && 1 <= ULTIMATE.start_main_~length~0) && s <= ULTIMATE.start_main_~nondetString~0.offset) && ULTIMATE.start_main_~length~0 + ULTIMATE.start_main_~nondetString~0.offset <= unknown-#length-unknown[s])) && 0 <= unknown-#memory_int-unknown[s][s]) && d <= 0) && dst <= 0) && 1 <= n)) || (((n == unknown-#length-unknown[nondetArea] && !(dst == dst)) && (((((!(nondetString == nondetArea) && !(dst == s)) && !(d == s)) && ((((((((((((((((((((((((0 <= src && length == unknown-#length-unknown[nondetString]) && 0 <= dst) && 0 <= dst) && 1 <= n) && 0 <= src) && \valid[nondetArea] == 1) && 1 <= \old(n)) && nondetString == 0) && \valid[dst] == 1) && \valid[s] == 1) && \valid[src] == 1) && 8 == unknown-#length-unknown[dst]) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[d]) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[src]) && 0 <= s) && dst <= 0) && (\valid[dst] == 1 || dst == dst)) && nondetArea == nondetString) && 1 <= d) && \valid[nondetString] == 1) && \old(n) + dst <= unknown-#length-unknown[dst]) && dst <= 0) && (length + nondetString == 1 || (1 <= length && length == unknown-#length-unknown[nondetString]))) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + ULTIMATE.start_main_~nondetString~0.offset + -1] && ULTIMATE.start_main_~nondetString~0.offset <= 0) && 0 <= ULTIMATE.start_main_~nondetString~0.offset)) && 1 <= n) && s + 1 <= unknown-#length-unknown[s]) && n + d <= unknown-#length-unknown[d]) 362.28/278.94 - StatisticsResult: Ultimate Automizer benchmark data 362.28/278.94 CFG has 1 procedures, 42 locations, 20 error locations. SAFE Result, 246.5s OverallTime, 47 OverallIterations, 14 TraceHistogramMax, 138.3s AutomataDifference, 0.0s DeadEndRemovalTime, 74.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 419 SDtfs, 6762 SDslu, 9262 SDs, 0 SdLazy, 30329 SolverSat, 4037 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2553 GetRequests, 531 SyntacticMatches, 9 SemanticMatches, 2013 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59707 ImplicationChecksByTransitivity, 124.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=319occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 47 MinimizatonAttempts, 2376 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 117 NumberOfFragments, 2027 HoareAnnotationTreeSize, 2 FomulaSimplifications, 75313239014 FormulaSimplificationTreeSizeReduction, 11.6s HoareSimplificationTime, 2 FomulaSimplificationsInter, 3145381018 FormulaSimplificationTreeSizeReductionInter, 63.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 27.0s InterpolantComputationTime, 1908 NumberOfCodeBlocks, 1907 NumberOfCodeBlocksAsserted, 89 NumberOfCheckSat, 1838 ConstructedInterpolants, 572 QuantifiedInterpolants, 1296899 SizeOfPredicates, 495 NumberOfNonLiveVariables, 5497 ConjunctsInSsa, 1235 ConjunctsInUnsatCore, 70 InterpolantComputations, 24 PerfectInterpolantSequences, 646/2679 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 362.28/278.94 - StatisticsResult: Constructed decomposition of program 362.28/278.94 Your program was decomposed into 9 terminating modules (7 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function n and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 5 locations. 7 modules have a trivial ranking function, the largest among these consists of 6 locations. 362.28/278.94 - StatisticsResult: Timing statistics 362.28/278.94 BüchiAutomizer plugin needed 26.7s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 25.6s. Construction of modules took 0.4s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 47 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 54 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 147 SDtfs, 347 SDslu, 482 SDs, 0 SdLazy, 603 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc6 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital546 mio100 ax100 hnf100 lsp98 ukn48 mio100 lsp46 div117 bol100 ite100 ukn100 eq193 hnf82 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 362.28/278.94 - TerminationAnalysisResult: Termination proven 362.28/278.94 Buchi Automizer proved that your program is terminating 362.28/278.94 RESULT: Ultimate proved your program to be correct! 362.28/278.94 !SESSION 2019-03-28 12:37:43.114 ----------------------------------------------- 362.28/278.94 eclipse.buildId=unknown 362.28/278.94 java.version=1.8.0_181 362.28/278.94 java.vendor=Oracle Corporation 362.28/278.94 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 362.28/278.94 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 362.28/278.94 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 362.28/278.94 362.28/278.94 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:42:21.219 362.28/278.94 !MESSAGE The workspace will exit with unsaved changes in this session. 362.28/278.94 Received shutdown request... 362.28/278.94 Ultimate: 362.28/278.94 GTK+ Version Check 362.28/278.94 EOF