./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35d30cdccac93bddd26c3755048a0b29ad39c8fa ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35d30cdccac93bddd26c3755048a0b29ad39c8fa ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:51:43,626 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:51:43,627 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:51:43,634 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:51:43,634 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:51:43,635 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:51:43,636 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:51:43,637 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:51:43,639 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:51:43,639 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:51:43,640 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:51:43,640 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:51:43,641 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:51:43,641 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:51:43,642 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:51:43,643 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:51:43,643 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:51:43,644 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:51:43,646 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:51:43,647 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:51:43,647 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:51:43,648 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:51:43,649 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:51:43,649 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:51:43,649 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:51:43,650 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:51:43,651 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:51:43,651 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:51:43,652 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:51:43,653 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:51:43,653 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:51:43,654 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:51:43,654 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:51:43,654 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:51:43,654 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:51:43,655 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:51:43,655 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf [2018-11-18 16:51:43,663 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:51:43,663 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:51:43,663 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:51:43,663 INFO L133 SettingsManager]: * Process only entry and re-entry procedures=false [2018-11-18 16:51:43,664 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:51:43,664 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:51:43,664 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:51:43,664 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:51:43,664 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:51:43,664 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:51:43,664 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:51:43,664 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:51:43,665 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:51:43,665 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:51:43,665 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:51:43,665 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:51:43,665 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:51:43,665 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:51:43,665 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:51:43,665 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:51:43,666 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:51:43,666 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:51:43,666 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:51:43,666 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:51:43,666 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:51:43,666 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:51:43,666 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:51:43,666 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:51:43,667 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:51:43,667 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:51:43,667 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35d30cdccac93bddd26c3755048a0b29ad39c8fa [2018-11-18 16:51:43,691 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:51:43,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:51:43,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:51:43,703 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:51:43,703 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:51:43,704 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-18 16:51:43,748 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/data/1fe01d890/9f434a3fbdcd46d3818aaa5f5158a6ec/FLAG7124ba20f [2018-11-18 16:51:44,170 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:51:44,170 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-18 16:51:44,174 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/data/1fe01d890/9f434a3fbdcd46d3818aaa5f5158a6ec/FLAG7124ba20f [2018-11-18 16:51:44,186 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/data/1fe01d890/9f434a3fbdcd46d3818aaa5f5158a6ec [2018-11-18 16:51:44,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:51:44,190 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 16:51:44,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:51:44,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:51:44,194 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:51:44,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:51:44" (1/1) ... [2018-11-18 16:51:44,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649584a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:44, skipping insertion in model container [2018-11-18 16:51:44,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:51:44" (1/1) ... [2018-11-18 16:51:44,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:51:44,226 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:51:44,365 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:51:44,371 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:51:44,388 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:51:44,405 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:51:44,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:44 WrapperNode [2018-11-18 16:51:44,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:51:44,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:51:44,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:51:44,406 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:51:44,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:44" (1/1) ... [2018-11-18 16:51:44,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:44" (1/1) ... [2018-11-18 16:51:44,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:44" (1/1) ... [2018-11-18 16:51:44,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:44" (1/1) ... [2018-11-18 16:51:44,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:44" (1/1) ... [2018-11-18 16:51:44,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:44" (1/1) ... [2018-11-18 16:51:44,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:44" (1/1) ... [2018-11-18 16:51:44,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:51:44,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:51:44,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:51:44,477 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:51:44,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:51:44,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:51:44,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:51:44,523 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-18 16:51:44,523 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-18 16:51:44,523 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-18 16:51:44,523 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-18 16:51:44,523 INFO L138 BoogieDeclarations]: Found implementation of procedure malloc [2018-11-18 16:51:44,523 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:51:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 16:51:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-18 16:51:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-18 16:51:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 16:51:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 16:51:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-18 16:51:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 16:51:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-18 16:51:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 16:51:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 16:51:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:51:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:51:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 16:51:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:51:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 16:51:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 16:51:44,732 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:51:44,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:51:44 BoogieIcfgContainer [2018-11-18 16:51:44,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:51:44,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:51:44,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:51:44,735 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:51:44,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:51:44" (1/3) ... [2018-11-18 16:51:44,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c59c08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:51:44, skipping insertion in model container [2018-11-18 16:51:44,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:51:44" (2/3) ... [2018-11-18 16:51:44,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c59c08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:51:44, skipping insertion in model container [2018-11-18 16:51:44,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:51:44" (3/3) ... [2018-11-18 16:51:44,738 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-18 16:51:44,744 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:51:44,748 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:51:44,760 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:51:44,779 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:51:44,779 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:51:44,779 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:51:44,779 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:51:44,779 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:51:44,780 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:51:44,780 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:51:44,780 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:51:44,780 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:51:44,791 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-18 16:51:44,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 16:51:44,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:44,795 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:44,797 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:51:44,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:44,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1866402238, now seen corresponding path program 1 times [2018-11-18 16:51:44,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:51:44,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:51:44,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:44,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:44,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 16:51:44,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:51:44,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:51:44,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 16:51:44,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 16:51:44,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:51:44,935 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-11-18 16:51:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:44,953 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2018-11-18 16:51:44,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 16:51:44,954 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 40 [2018-11-18 16:51:44,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:44,962 INFO L225 Difference]: With dead ends: 89 [2018-11-18 16:51:44,963 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 16:51:44,966 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:51:44,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 16:51:44,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-18 16:51:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 16:51:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-18 16:51:44,996 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 40 [2018-11-18 16:51:44,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:44,996 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-18 16:51:44,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 16:51:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-18 16:51:44,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 16:51:44,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:44,999 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:44,999 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:51:44,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:44,999 INFO L82 PathProgramCache]: Analyzing trace with hash -44847792, now seen corresponding path program 1 times [2018-11-18 16:51:44,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:51:45,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:51:45,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:45,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:45,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 16:51:45,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:51:45,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:51:45,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:51:45,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:51:45,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:51:45,055 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 3 states. [2018-11-18 16:51:45,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:45,074 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-11-18 16:51:45,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:51:45,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-18 16:51:45,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:45,075 INFO L225 Difference]: With dead ends: 80 [2018-11-18 16:51:45,075 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 16:51:45,076 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:51:45,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 16:51:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-18 16:51:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 16:51:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-18 16:51:45,081 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 43 [2018-11-18 16:51:45,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:45,081 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-18 16:51:45,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:51:45,081 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-18 16:51:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 16:51:45,081 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:45,082 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:45,082 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:51:45,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:45,082 INFO L82 PathProgramCache]: Analyzing trace with hash 992063202, now seen corresponding path program 1 times [2018-11-18 16:51:45,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:51:45,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:51:45,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:45,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:45,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:45,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 16:51:45,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:45,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:51:45,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:45,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 16:51:45,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:51:45,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-18 16:51:45,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:51:45,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:51:45,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:51:45,257 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-11-18 16:51:45,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:45,274 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-18 16:51:45,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:51:45,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-18 16:51:45,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:45,277 INFO L225 Difference]: With dead ends: 74 [2018-11-18 16:51:45,277 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 16:51:45,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:51:45,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 16:51:45,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-11-18 16:51:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 16:51:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-11-18 16:51:45,286 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 46 [2018-11-18 16:51:45,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:45,286 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-11-18 16:51:45,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:51:45,286 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-11-18 16:51:45,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 16:51:45,287 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:45,287 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:45,287 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:51:45,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:45,287 INFO L82 PathProgramCache]: Analyzing trace with hash 9382982, now seen corresponding path program 1 times [2018-11-18 16:51:45,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:51:45,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:51:45,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:45,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:45,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:45,339 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 16:51:45,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:45,340 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:51:45,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:45,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 16:51:45,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:51:45,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 16:51:45,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:51:45,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:51:45,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:51:45,432 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 5 states. [2018-11-18 16:51:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:45,450 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2018-11-18 16:51:45,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:51:45,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-18 16:51:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:45,452 INFO L225 Difference]: With dead ends: 86 [2018-11-18 16:51:45,452 INFO L226 Difference]: Without dead ends: 51 [2018-11-18 16:51:45,452 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:51:45,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-18 16:51:45,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-18 16:51:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 16:51:45,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-11-18 16:51:45,457 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 48 [2018-11-18 16:51:45,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:45,457 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-11-18 16:51:45,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:51:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-18 16:51:45,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 16:51:45,458 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:45,458 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:45,459 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:51:45,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:45,459 INFO L82 PathProgramCache]: Analyzing trace with hash -511879692, now seen corresponding path program 2 times [2018-11-18 16:51:45,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:51:45,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:51:45,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:45,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:45,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:46,682 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2018-11-18 16:51:47,092 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 81 [2018-11-18 16:51:47,470 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 80 [2018-11-18 16:51:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 16:51:47,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:47,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:51:47,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 16:51:47,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 16:51:47,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:51:47,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:47,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 16:51:47,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-18 16:51:47,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:47,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:47,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:47,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-18 16:51:47,831 INFO L477 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 11 [2018-11-18 16:51:47,833 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 16:51:47,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:47,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:47,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:47,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-18 16:51:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 16:51:47,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:51:47,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [25] total 29 [2018-11-18 16:51:47,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 16:51:47,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 16:51:47,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2018-11-18 16:51:47,854 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 29 states. [2018-11-18 16:51:50,144 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2018-11-18 16:51:50,547 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 89 [2018-11-18 16:51:50,997 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 91 [2018-11-18 16:51:51,681 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 92 [2018-11-18 16:51:52,567 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 90 [2018-11-18 16:51:54,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:54,716 INFO L93 Difference]: Finished difference Result 257 states and 326 transitions. [2018-11-18 16:51:54,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-18 16:51:54,717 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2018-11-18 16:51:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:54,719 INFO L225 Difference]: With dead ends: 257 [2018-11-18 16:51:54,719 INFO L226 Difference]: Without dead ends: 236 [2018-11-18 16:51:54,721 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1604 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1179, Invalid=5463, Unknown=0, NotChecked=0, Total=6642 [2018-11-18 16:51:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-11-18 16:51:54,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 154. [2018-11-18 16:51:54,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-18 16:51:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 193 transitions. [2018-11-18 16:51:54,753 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 193 transitions. Word has length 51 [2018-11-18 16:51:54,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:54,753 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 193 transitions. [2018-11-18 16:51:54,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-18 16:51:54,753 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 193 transitions. [2018-11-18 16:51:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 16:51:54,755 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:54,755 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:54,755 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:51:54,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:54,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1028564101, now seen corresponding path program 1 times [2018-11-18 16:51:54,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:51:54,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:51:54,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:54,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:51:54,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:56,008 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2018-11-18 16:51:56,538 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 79 [2018-11-18 16:51:56,909 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 89 [2018-11-18 16:51:57,264 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 89 [2018-11-18 16:51:57,509 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 16:51:57,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:57,509 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:51:57,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:57,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:57,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 16:51:57,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-18 16:51:57,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:57,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:57,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:57,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-18 16:51:57,915 INFO L477 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 7 treesize of output 5 [2018-11-18 16:51:57,917 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 16:51:57,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:57,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:57,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:57,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-18 16:51:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 16:51:58,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:51:58,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 37 [2018-11-18 16:51:58,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-18 16:51:58,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-18 16:51:58,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1220, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 16:51:58,062 INFO L87 Difference]: Start difference. First operand 154 states and 193 transitions. Second operand 37 states. [2018-11-18 16:51:59,337 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2018-11-18 16:52:00,088 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2018-11-18 16:52:01,091 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2018-11-18 16:52:01,353 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 100 [2018-11-18 16:52:01,728 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 98 [2018-11-18 16:52:02,266 WARN L180 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 115 [2018-11-18 16:52:02,705 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 113 [2018-11-18 16:52:03,460 WARN L180 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 124 [2018-11-18 16:52:03,941 WARN L180 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 122 [2018-11-18 16:52:04,622 WARN L180 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 126 [2018-11-18 16:52:05,137 WARN L180 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 124 [2018-11-18 16:52:06,878 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 28 [2018-11-18 16:52:07,127 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 42 [2018-11-18 16:52:07,387 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 44 [2018-11-18 16:52:07,678 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 25 [2018-11-18 16:52:07,976 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 40 [2018-11-18 16:52:08,256 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 42 [2018-11-18 16:52:08,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:52:08,468 INFO L93 Difference]: Finished difference Result 285 states and 351 transitions. [2018-11-18 16:52:08,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-18 16:52:08,468 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 55 [2018-11-18 16:52:08,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:52:08,470 INFO L225 Difference]: With dead ends: 285 [2018-11-18 16:52:08,470 INFO L226 Difference]: Without dead ends: 245 [2018-11-18 16:52:08,472 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1597 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1071, Invalid=6239, Unknown=0, NotChecked=0, Total=7310 [2018-11-18 16:52:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-11-18 16:52:08,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 157. [2018-11-18 16:52:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-18 16:52:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 190 transitions. [2018-11-18 16:52:08,497 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 190 transitions. Word has length 55 [2018-11-18 16:52:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:52:08,497 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 190 transitions. [2018-11-18 16:52:08,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-18 16:52:08,498 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 190 transitions. [2018-11-18 16:52:08,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 16:52:08,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:52:08,499 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:52:08,500 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:52:08,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:52:08,500 INFO L82 PathProgramCache]: Analyzing trace with hash -520184267, now seen corresponding path program 1 times [2018-11-18 16:52:08,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:52:08,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:52:08,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:52:08,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:52:08,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:52:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:52:08,546 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 16:52:08,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:52:08,547 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:52:08,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:52:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:52:08,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:52:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 16:52:08,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:52:08,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 16:52:08,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:52:08,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:52:08,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:52:08,617 INFO L87 Difference]: Start difference. First operand 157 states and 190 transitions. Second operand 5 states. [2018-11-18 16:52:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:52:08,649 INFO L93 Difference]: Finished difference Result 261 states and 318 transitions. [2018-11-18 16:52:08,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:52:08,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-11-18 16:52:08,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:52:08,651 INFO L225 Difference]: With dead ends: 261 [2018-11-18 16:52:08,651 INFO L226 Difference]: Without dead ends: 168 [2018-11-18 16:52:08,652 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:52:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-18 16:52:08,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2018-11-18 16:52:08,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-18 16:52:08,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 199 transitions. [2018-11-18 16:52:08,677 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 199 transitions. Word has length 60 [2018-11-18 16:52:08,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:52:08,678 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 199 transitions. [2018-11-18 16:52:08,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:52:08,678 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 199 transitions. [2018-11-18 16:52:08,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 16:52:08,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:52:08,679 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:52:08,679 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:52:08,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:52:08,680 INFO L82 PathProgramCache]: Analyzing trace with hash 478721959, now seen corresponding path program 1 times [2018-11-18 16:52:08,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:52:08,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:52:08,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:52:08,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:52:08,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:52:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:52:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 16:52:09,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:52:09,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:52:09,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:52:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:52:09,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:52:09,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 16:52:09,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-18 16:52:09,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:09,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:09,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:09,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-18 16:52:09,803 INFO L477 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 11 [2018-11-18 16:52:09,804 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 16:52:09,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:09,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:09,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:09,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-18 16:52:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 16:52:09,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:52:09,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2018-11-18 16:52:09,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-18 16:52:09,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-18 16:52:09,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2018-11-18 16:52:09,861 INFO L87 Difference]: Start difference. First operand 166 states and 199 transitions. Second operand 30 states. [2018-11-18 16:52:10,907 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-11-18 16:52:11,171 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2018-11-18 16:52:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:52:11,772 INFO L93 Difference]: Finished difference Result 236 states and 282 transitions. [2018-11-18 16:52:11,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 16:52:11,772 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 61 [2018-11-18 16:52:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:52:11,773 INFO L225 Difference]: With dead ends: 236 [2018-11-18 16:52:11,774 INFO L226 Difference]: Without dead ends: 113 [2018-11-18 16:52:11,775 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=331, Invalid=2119, Unknown=0, NotChecked=0, Total=2450 [2018-11-18 16:52:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-18 16:52:11,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2018-11-18 16:52:11,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-18 16:52:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-11-18 16:52:11,788 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 61 [2018-11-18 16:52:11,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:52:11,788 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-11-18 16:52:11,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-18 16:52:11,789 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-11-18 16:52:11,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 16:52:11,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:52:11,789 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:52:11,790 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:52:11,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:52:11,790 INFO L82 PathProgramCache]: Analyzing trace with hash 517484025, now seen corresponding path program 2 times [2018-11-18 16:52:11,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:52:11,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:52:11,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:52:11,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:52:11,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:52:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:52:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 16:52:11,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:52:11,994 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:52:12,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 16:52:12,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 16:52:12,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:52:12,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:52:12,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-18 16:52:12,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2018-11-18 16:52:12,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:12,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:12,137 INFO L267 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. [2018-11-18 16:52:12,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-11-18 16:52:12,244 INFO L477 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 21 treesize of output 17 [2018-11-18 16:52:12,245 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:12,246 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 16:52:12,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:12,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:12,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:12,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2018-11-18 16:52:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 16:52:12,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:52:12,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 29 [2018-11-18 16:52:12,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 16:52:12,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 16:52:12,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2018-11-18 16:52:12,290 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 29 states. [2018-11-18 16:52:13,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:52:13,029 INFO L93 Difference]: Finished difference Result 151 states and 179 transitions. [2018-11-18 16:52:13,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 16:52:13,030 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 61 [2018-11-18 16:52:13,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:52:13,031 INFO L225 Difference]: With dead ends: 151 [2018-11-18 16:52:13,031 INFO L226 Difference]: Without dead ends: 126 [2018-11-18 16:52:13,031 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=1721, Unknown=0, NotChecked=0, Total=1892 [2018-11-18 16:52:13,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-18 16:52:13,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2018-11-18 16:52:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-18 16:52:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2018-11-18 16:52:13,048 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 61 [2018-11-18 16:52:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:52:13,048 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2018-11-18 16:52:13,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-18 16:52:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2018-11-18 16:52:13,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 16:52:13,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:52:13,049 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:52:13,049 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:52:13,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:52:13,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1529761030, now seen corresponding path program 2 times [2018-11-18 16:52:13,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:52:13,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:52:13,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:52:13,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:52:13,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:52:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:52:14,221 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 70 [2018-11-18 16:52:14,807 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 73 [2018-11-18 16:52:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 16:52:15,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:52:15,022 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:52:15,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 16:52:15,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 16:52:15,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:52:15,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:52:15,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-11-18 16:52:15,068 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-18 16:52:15,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:15,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:15,078 INFO L477 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 7 treesize of output 6 [2018-11-18 16:52:15,078 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:15,085 INFO L477 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 7 treesize of output 6 [2018-11-18 16:52:15,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:15,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:15,092 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2018-11-18 16:52:15,133 INFO L477 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 6 treesize of output 4 [2018-11-18 16:52:15,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:15,143 INFO L477 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 6 treesize of output 4 [2018-11-18 16:52:15,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:15,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:15,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:13 [2018-11-18 16:52:15,387 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:15,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 29 [2018-11-18 16:52:15,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:15,396 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:15,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 29 [2018-11-18 16:52:15,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:15,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:15,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:35 [2018-11-18 16:52:15,593 INFO L477 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 6 treesize of output 4 [2018-11-18 16:52:15,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:15,597 INFO L477 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 6 treesize of output 4 [2018-11-18 16:52:15,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:15,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:15,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-11-18 16:52:20,901 WARN L180 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 16:52:20,906 INFO L477 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 6 treesize of output 4 [2018-11-18 16:52:20,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:20,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 17 [2018-11-18 16:52:20,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:20,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:52:20,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2018-11-18 16:52:21,687 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 16:52:21,689 INFO L477 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 13 treesize of output 11 [2018-11-18 16:52:21,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:21,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:21,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2018-11-18 16:52:22,501 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 16:52:23,273 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-18 16:52:24,062 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-18 16:52:24,067 INFO L477 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 19 treesize of output 15 [2018-11-18 16:52:24,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:24,071 INFO L267 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. [2018-11-18 16:52:24,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:25, output treesize:18 [2018-11-18 16:52:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 21 refuted. 2 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 16:52:24,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:52:24,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 43 [2018-11-18 16:52:24,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-18 16:52:24,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-18 16:52:24,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1637, Unknown=16, NotChecked=0, Total=1806 [2018-11-18 16:52:24,147 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand 43 states. [2018-11-18 16:52:44,005 WARN L180 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2018-11-18 16:52:46,451 WARN L180 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 91 DAG size of output: 41 [2018-11-18 16:53:00,241 WARN L180 SmtUtils]: Spent 985.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 33 [2018-11-18 16:53:03,835 WARN L180 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 37 [2018-11-18 16:53:09,473 WARN L180 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 37 [2018-11-18 16:53:14,453 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 139 DAG size of output: 43 [2018-11-18 16:53:18,955 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 148 DAG size of output: 52 [2018-11-18 16:53:23,468 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 151 DAG size of output: 55 [2018-11-18 16:53:29,028 WARN L180 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 88 DAG size of output: 43 [2018-11-18 16:53:34,392 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2018-11-18 16:53:35,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:35,179 INFO L93 Difference]: Finished difference Result 189 states and 220 transitions. [2018-11-18 16:53:35,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 16:53:35,180 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 64 [2018-11-18 16:53:35,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:35,180 INFO L225 Difference]: With dead ends: 189 [2018-11-18 16:53:35,180 INFO L226 Difference]: Without dead ends: 160 [2018-11-18 16:53:35,181 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 50.9s TimeCoverageRelationStatistics Valid=541, Invalid=3694, Unknown=55, NotChecked=0, Total=4290 [2018-11-18 16:53:35,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-18 16:53:35,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129. [2018-11-18 16:53:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-18 16:53:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 146 transitions. [2018-11-18 16:53:35,202 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 146 transitions. Word has length 64 [2018-11-18 16:53:35,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:35,203 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 146 transitions. [2018-11-18 16:53:35,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-18 16:53:35,203 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 146 transitions. [2018-11-18 16:53:35,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 16:53:35,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:35,203 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:35,203 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:53:35,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:35,204 INFO L82 PathProgramCache]: Analyzing trace with hash 505563271, now seen corresponding path program 1 times [2018-11-18 16:53:35,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:35,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:35,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:35,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:53:35,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 16:53:35,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:53:35,242 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:53:35,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:35,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 16:53:35,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:53:35,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-11-18 16:53:35,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:53:35,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:53:35,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:53:35,333 INFO L87 Difference]: Start difference. First operand 129 states and 146 transitions. Second operand 6 states. [2018-11-18 16:53:35,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:35,385 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2018-11-18 16:53:35,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:53:35,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-18 16:53:35,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:35,386 INFO L225 Difference]: With dead ends: 171 [2018-11-18 16:53:35,386 INFO L226 Difference]: Without dead ends: 121 [2018-11-18 16:53:35,387 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:53:35,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-18 16:53:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 93. [2018-11-18 16:53:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-18 16:53:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-11-18 16:53:35,408 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 69 [2018-11-18 16:53:35,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:35,408 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-11-18 16:53:35,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:53:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-11-18 16:53:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 16:53:35,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:35,409 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:35,409 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:53:35,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:35,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1476171290, now seen corresponding path program 1 times [2018-11-18 16:53:35,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:35,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:35,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:35,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:35,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:35,699 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 16:53:35,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:53:35,699 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:53:35,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:35,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:35,977 INFO L477 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 11 [2018-11-18 16:53:35,978 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 16:53:35,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:35,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:35,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:35,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-18 16:53:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 16:53:36,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:53:36,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 37 [2018-11-18 16:53:36,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-18 16:53:36,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-18 16:53:36,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1223, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 16:53:36,020 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 37 states. [2018-11-18 16:53:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:36,916 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-11-18 16:53:36,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-18 16:53:36,916 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2018-11-18 16:53:36,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:36,917 INFO L225 Difference]: With dead ends: 115 [2018-11-18 16:53:36,917 INFO L226 Difference]: Without dead ends: 105 [2018-11-18 16:53:36,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=366, Invalid=2940, Unknown=0, NotChecked=0, Total=3306 [2018-11-18 16:53:36,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-18 16:53:36,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 92. [2018-11-18 16:53:36,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-18 16:53:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2018-11-18 16:53:36,935 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 71 [2018-11-18 16:53:36,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:36,936 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2018-11-18 16:53:36,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-18 16:53:36,936 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2018-11-18 16:53:36,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 16:53:36,936 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:36,937 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:36,937 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:53:36,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:36,937 INFO L82 PathProgramCache]: Analyzing trace with hash -129465976, now seen corresponding path program 1 times [2018-11-18 16:53:36,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:36,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:36,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:36,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:36,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:36,969 ERROR L253 erpolLogProxyWrapper]: Interpolant 35 not inductive: (Check returned sat) [2018-11-18 16:53:36,985 ERROR L253 erpolLogProxyWrapper]: Interpolant 46 not inductive: (Check returned sat) [2018-11-18 16:53:36,993 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1007) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 16:53:36,996 INFO L168 Benchmark]: Toolchain (without parser) took 112806.94 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 364.9 MB). Free memory was 959.2 MB in the beginning and 979.4 MB in the end (delta: -20.2 MB). Peak memory consumption was 344.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:53:36,997 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:53:36,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.91 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-18 16:53:36,997 INFO L168 Benchmark]: Boogie Preprocessor took 70.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -201.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-18 16:53:36,998 INFO L168 Benchmark]: RCFGBuilder took 255.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:53:36,998 INFO L168 Benchmark]: TraceAbstraction took 112262.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 222.8 MB). Free memory was 1.1 GB in the beginning and 979.4 MB in the end (delta: 140.1 MB). Peak memory consumption was 363.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:53:37,000 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 214.91 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -201.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 255.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 112262.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 222.8 MB). Free memory was 1.1 GB in the beginning and 979.4 MB in the end (delta: 140.1 MB). Peak memory consumption was 363.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1007) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 16:53:38,460 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:53:38,461 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:53:38,471 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:53:38,471 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:53:38,472 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:53:38,473 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:53:38,474 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:53:38,475 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:53:38,476 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:53:38,477 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:53:38,477 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:53:38,478 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:53:38,479 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:53:38,479 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:53:38,480 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:53:38,481 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:53:38,482 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:53:38,484 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:53:38,485 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:53:38,485 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:53:38,487 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:53:38,488 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:53:38,489 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:53:38,489 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:53:38,490 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:53:38,491 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:53:38,491 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:53:38,492 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:53:38,493 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:53:38,493 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:53:38,494 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:53:38,494 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:53:38,494 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:53:38,494 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:53:38,495 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:53:38,495 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 16:53:38,507 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:53:38,507 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:53:38,507 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:53:38,508 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 16:53:38,508 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:53:38,508 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:53:38,508 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:53:38,509 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:53:38,509 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:53:38,509 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:53:38,509 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:53:38,509 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:53:38,509 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:53:38,509 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:53:38,510 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 16:53:38,510 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 16:53:38,510 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:53:38,512 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:53:38,512 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:53:38,512 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:53:38,512 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:53:38,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:53:38,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:53:38,513 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:53:38,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:53:38,513 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:53:38,513 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:53:38,513 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:53:38,513 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 16:53:38,513 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:53:38,514 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 16:53:38,514 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 16:53:38,514 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35d30cdccac93bddd26c3755048a0b29ad39c8fa [2018-11-18 16:53:38,545 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:53:38,556 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:53:38,559 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:53:38,560 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:53:38,560 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:53:38,561 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-18 16:53:38,610 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/data/b2ed66cad/9c08170f20d1439a9a53db56584b353c/FLAG257a3309c [2018-11-18 16:53:38,953 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:53:38,953 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-18 16:53:38,957 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/data/b2ed66cad/9c08170f20d1439a9a53db56584b353c/FLAG257a3309c [2018-11-18 16:53:39,376 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/data/b2ed66cad/9c08170f20d1439a9a53db56584b353c [2018-11-18 16:53:39,378 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:53:39,379 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 16:53:39,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:53:39,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:53:39,382 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:53:39,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:53:39" (1/1) ... [2018-11-18 16:53:39,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26edcba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:39, skipping insertion in model container [2018-11-18 16:53:39,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:53:39" (1/1) ... [2018-11-18 16:53:39,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:53:39,409 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:53:39,533 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:53:39,539 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:53:39,555 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:53:39,575 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:53:39,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:39 WrapperNode [2018-11-18 16:53:39,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:53:39,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:53:39,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:53:39,577 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:53:39,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:39" (1/1) ... [2018-11-18 16:53:39,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:39" (1/1) ... [2018-11-18 16:53:39,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:39" (1/1) ... [2018-11-18 16:53:39,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:39" (1/1) ... [2018-11-18 16:53:39,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:39" (1/1) ... [2018-11-18 16:53:39,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:39" (1/1) ... [2018-11-18 16:53:39,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:39" (1/1) ... [2018-11-18 16:53:39,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:53:39,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:53:39,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:53:39,606 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:53:39,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:53:39,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:53:39,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:53:39,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-18 16:53:39,696 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-18 16:53:39,696 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-18 16:53:39,696 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-18 16:53:39,696 INFO L138 BoogieDeclarations]: Found implementation of procedure malloc [2018-11-18 16:53:39,696 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:53:39,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 16:53:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-18 16:53:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-18 16:53:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 16:53:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 16:53:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-18 16:53:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 16:53:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-18 16:53:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 16:53:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 16:53:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:53:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:53:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 16:53:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:53:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 16:53:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 16:53:39,927 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:53:39,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:53:39 BoogieIcfgContainer [2018-11-18 16:53:39,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:53:39,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:53:39,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:53:39,931 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:53:39,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:53:39" (1/3) ... [2018-11-18 16:53:39,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c69e7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:53:39, skipping insertion in model container [2018-11-18 16:53:39,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:53:39" (2/3) ... [2018-11-18 16:53:39,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c69e7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:53:39, skipping insertion in model container [2018-11-18 16:53:39,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:53:39" (3/3) ... [2018-11-18 16:53:39,933 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-18 16:53:39,939 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:53:39,944 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:53:39,953 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:53:39,970 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:53:39,971 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:53:39,971 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:53:39,971 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:53:39,971 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:53:39,971 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:53:39,971 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:53:39,971 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:53:39,971 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:53:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-18 16:53:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 16:53:39,986 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:39,987 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:39,989 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:53:39,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:39,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1866402238, now seen corresponding path program 1 times [2018-11-18 16:53:39,996 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:53:39,996 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:53:40,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:40,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 16:53:40,118 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 16:53:40,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:53:40,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:53:40,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 16:53:40,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 16:53:40,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:53:40,142 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-11-18 16:53:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:40,168 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2018-11-18 16:53:40,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 16:53:40,170 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 40 [2018-11-18 16:53:40,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:40,179 INFO L225 Difference]: With dead ends: 89 [2018-11-18 16:53:40,180 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 16:53:40,183 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:53:40,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 16:53:40,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-18 16:53:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 16:53:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-18 16:53:40,214 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 40 [2018-11-18 16:53:40,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:40,215 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-18 16:53:40,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 16:53:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-18 16:53:40,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 16:53:40,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:40,217 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:40,218 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:53:40,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:40,218 INFO L82 PathProgramCache]: Analyzing trace with hash -44847792, now seen corresponding path program 1 times [2018-11-18 16:53:40,219 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:53:40,219 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:53:40,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:40,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:40,333 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 16:53:40,333 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:53:40,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:53:40,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:53:40,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:53:40,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:53:40,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:53:40,338 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 3 states. [2018-11-18 16:53:40,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:40,367 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-11-18 16:53:40,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:53:40,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-18 16:53:40,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:40,369 INFO L225 Difference]: With dead ends: 80 [2018-11-18 16:53:40,370 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 16:53:40,370 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:53:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 16:53:40,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-18 16:53:40,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 16:53:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-18 16:53:40,376 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 43 [2018-11-18 16:53:40,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:40,376 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-18 16:53:40,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:53:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-18 16:53:40,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 16:53:40,378 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:40,378 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:40,378 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:53:40,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:40,379 INFO L82 PathProgramCache]: Analyzing trace with hash 992063202, now seen corresponding path program 1 times [2018-11-18 16:53:40,379 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:53:40,379 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:53:40,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:40,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 16:53:40,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:53:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 16:53:40,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:53:40,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 16:53:40,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:53:40,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:53:40,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:53:40,552 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 6 states. [2018-11-18 16:53:40,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:40,618 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2018-11-18 16:53:40,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:53:40,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-18 16:53:40,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:40,619 INFO L225 Difference]: With dead ends: 83 [2018-11-18 16:53:40,619 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 16:53:40,620 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:53:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 16:53:40,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-18 16:53:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 16:53:40,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-11-18 16:53:40,625 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 46 [2018-11-18 16:53:40,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:40,625 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-18 16:53:40,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:53:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-18 16:53:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 16:53:40,627 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:40,627 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:40,627 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:53:40,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:40,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2092274672, now seen corresponding path program 2 times [2018-11-18 16:53:40,628 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:53:40,628 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:53:40,640 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 16:53:40,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 16:53:40,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:53:40,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 16:53:40,721 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:53:40,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:53:40,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:53:40,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:53:40,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:53:40,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:53:40,723 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 3 states. [2018-11-18 16:53:40,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:40,746 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2018-11-18 16:53:40,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:53:40,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-18 16:53:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:40,749 INFO L225 Difference]: With dead ends: 77 [2018-11-18 16:53:40,749 INFO L226 Difference]: Without dead ends: 55 [2018-11-18 16:53:40,749 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:53:40,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-18 16:53:40,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-11-18 16:53:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 16:53:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-11-18 16:53:40,755 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 49 [2018-11-18 16:53:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:40,755 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-11-18 16:53:40,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:53:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-18 16:53:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 16:53:40,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:40,756 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:40,756 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:53:40,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:40,757 INFO L82 PathProgramCache]: Analyzing trace with hash -511879692, now seen corresponding path program 1 times [2018-11-18 16:53:40,757 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:53:40,757 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:53:40,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:53:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:40,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:40,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 16:53:41,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-18 16:53:41,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:41,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:41,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:41,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-18 16:53:41,102 INFO L477 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 7 treesize of output 5 [2018-11-18 16:53:41,104 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 16:53:41,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:41,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:41,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:41,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-18 16:53:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 16:53:41,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:53:41,476 INFO L477 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 13 [2018-11-18 16:53:41,494 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-11-18 16:53:41,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:41,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:53:41,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:53:41,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-11-18 16:53:41,669 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 16:53:41,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:53:41,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2018-11-18 16:53:41,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-18 16:53:41,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-18 16:53:41,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2018-11-18 16:53:41,671 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 27 states. [2018-11-18 16:53:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:43,108 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2018-11-18 16:53:43,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 16:53:43,109 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2018-11-18 16:53:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:43,110 INFO L225 Difference]: With dead ends: 102 [2018-11-18 16:53:43,110 INFO L226 Difference]: Without dead ends: 86 [2018-11-18 16:53:43,111 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=268, Invalid=1538, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 16:53:43,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-18 16:53:43,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2018-11-18 16:53:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 16:53:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2018-11-18 16:53:43,122 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 51 [2018-11-18 16:53:43,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:43,122 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2018-11-18 16:53:43,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-18 16:53:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2018-11-18 16:53:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 16:53:43,124 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:43,124 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:43,124 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:53:43,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:43,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1201479543, now seen corresponding path program 1 times [2018-11-18 16:53:43,125 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:53:43,125 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:53:43,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:43,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 16:53:43,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:53:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 16:53:43,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:53:43,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 16:53:43,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:53:43,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:53:43,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:53:43,269 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 6 states. [2018-11-18 16:53:43,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:43,318 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2018-11-18 16:53:43,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:53:43,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-11-18 16:53:43,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:43,320 INFO L225 Difference]: With dead ends: 113 [2018-11-18 16:53:43,321 INFO L226 Difference]: Without dead ends: 82 [2018-11-18 16:53:43,321 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:53:43,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-18 16:53:43,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2018-11-18 16:53:43,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-18 16:53:43,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2018-11-18 16:53:43,331 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 54 [2018-11-18 16:53:43,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:43,331 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2018-11-18 16:53:43,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:53:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2018-11-18 16:53:43,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 16:53:43,332 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:43,332 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:43,332 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:53:43,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:43,332 INFO L82 PathProgramCache]: Analyzing trace with hash -2045675653, now seen corresponding path program 1 times [2018-11-18 16:53:43,332 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:53:43,333 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:53:43,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:43,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:43,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 16:53:43,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-18 16:53:43,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:43,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:43,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:43,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-18 16:53:43,464 INFO L477 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 17 treesize of output 13 [2018-11-18 16:53:43,467 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-18 16:53:43,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:43,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:43,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:43,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-18 16:53:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 16:53:43,484 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:53:43,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:53:43,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 16:53:43,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 16:53:43,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 16:53:43,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:53:43,487 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand 7 states. [2018-11-18 16:53:43,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:43,741 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2018-11-18 16:53:43,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:53:43,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-11-18 16:53:43,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:43,743 INFO L225 Difference]: With dead ends: 111 [2018-11-18 16:53:43,744 INFO L226 Difference]: Without dead ends: 98 [2018-11-18 16:53:43,744 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:53:43,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-18 16:53:43,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2018-11-18 16:53:43,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-18 16:53:43,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2018-11-18 16:53:43,757 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 55 [2018-11-18 16:53:43,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:43,757 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2018-11-18 16:53:43,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 16:53:43,757 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2018-11-18 16:53:43,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 16:53:43,759 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:43,759 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:43,760 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:53:43,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:43,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1869702828, now seen corresponding path program 2 times [2018-11-18 16:53:43,760 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:53:43,760 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:53:43,774 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 16:53:43,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 16:53:43,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:53:43,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:43,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 16:53:43,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-11-18 16:53:43,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:43,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:44,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:44,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-18 16:53:44,038 INFO L477 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 9 treesize of output 7 [2018-11-18 16:53:44,050 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 16:53:44,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:44,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:44,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:44,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-18 16:53:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 16:53:44,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:53:44,507 INFO L477 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 17 treesize of output 15 [2018-11-18 16:53:44,522 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-11-18 16:53:44,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:44,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:53:44,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:53:44,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-11-18 16:53:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 16:53:44,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:53:44,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2018-11-18 16:53:44,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-18 16:53:44,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-18 16:53:44,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2018-11-18 16:53:44,731 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 32 states. [2018-11-18 16:53:46,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:46,808 INFO L93 Difference]: Finished difference Result 160 states and 191 transitions. [2018-11-18 16:53:46,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 16:53:46,809 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 59 [2018-11-18 16:53:46,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:46,810 INFO L225 Difference]: With dead ends: 160 [2018-11-18 16:53:46,810 INFO L226 Difference]: Without dead ends: 144 [2018-11-18 16:53:46,811 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=389, Invalid=2581, Unknown=0, NotChecked=0, Total=2970 [2018-11-18 16:53:46,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-18 16:53:46,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 109. [2018-11-18 16:53:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-18 16:53:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2018-11-18 16:53:46,826 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 59 [2018-11-18 16:53:46,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:46,826 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2018-11-18 16:53:46,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-18 16:53:46,826 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2018-11-18 16:53:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 16:53:46,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:46,827 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:46,828 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:53:46,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:46,828 INFO L82 PathProgramCache]: Analyzing trace with hash -709140094, now seen corresponding path program 1 times [2018-11-18 16:53:46,828 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:53:46,828 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:53:46,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:53:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:46,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:46,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-18 16:53:46,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2018-11-18 16:53:46,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:46,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:47,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:47,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-18 16:53:47,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-18 16:53:47,040 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:47,041 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 16:53:47,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:47,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:47,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 16:53:47,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-11-18 16:53:47,060 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:47,062 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:47,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:47,069 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-11-18 16:53:47,087 INFO L477 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 17 treesize of output 13 [2018-11-18 16:53:47,090 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:47,091 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 16:53:47,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:47,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:47,101 INFO L477 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 9 treesize of output 7 [2018-11-18 16:53:47,103 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 16:53:47,103 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:47,104 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:47,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:47,109 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:10 [2018-11-18 16:54:04,092 WARN L180 SmtUtils]: Spent 6.03 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 16:54:08,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-18 16:54:08,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2018-11-18 16:54:08,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:54:08,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:54:08,209 INFO L477 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 17 treesize of output 13 [2018-11-18 16:54:08,212 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:54:08,213 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 16:54:08,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:54:08,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:54:08,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:54:08,222 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:12 [2018-11-18 16:54:08,260 INFO L477 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 8 treesize of output 6 [2018-11-18 16:54:08,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2018-11-18 16:54:08,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:54:08,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:54:08,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:54:08,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:7 [2018-11-18 16:54:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 16:54:14,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:54:14,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:54:14,636 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:54:14,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:54:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:54:14,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:54:14,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 16:54:14,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-11-18 16:54:14,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:54:14,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:54:14,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:54:14,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-18 16:54:14,798 INFO L477 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 11 treesize of output 9 [2018-11-18 16:54:14,800 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-11-18 16:54:14,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:54:14,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:54:14,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:54:14,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:7 [2018-11-18 16:54:14,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-18 16:54:14,901 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:54:14,901 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 16:54:14,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:54:14,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:54:14,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:54:14,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-18 16:54:15,045 INFO L477 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 26 treesize of output 20 [2018-11-18 16:54:15,047 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-11-18 16:54:15,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:54:15,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:54:15,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:54:15,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:5 [2018-11-18 16:54:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 16:54:15,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:54:15,500 INFO L477 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 16 treesize of output 14 [2018-11-18 16:54:15,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2018-11-18 16:54:15,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:54:15,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:54:15,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:54:15,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-11-18 16:54:15,614 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 16:54:15,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:54:15,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 10] total 36 [2018-11-18 16:54:15,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-18 16:54:15,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-18 16:54:15,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1527, Unknown=7, NotChecked=0, Total=1722 [2018-11-18 16:54:15,633 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand 36 states. [2018-11-18 16:54:53,075 WARN L180 SmtUtils]: Spent 5.82 s on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2018-11-18 16:55:49,910 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification that was a NOOP. DAG size: 39 [2018-11-18 17:00:46,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:00:46,893 INFO L93 Difference]: Finished difference Result 324 states and 398 transitions. [2018-11-18 17:00:46,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-18 17:00:46,893 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 59 [2018-11-18 17:00:46,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:00:46,895 INFO L225 Difference]: With dead ends: 324 [2018-11-18 17:00:46,895 INFO L226 Difference]: Without dead ends: 292 [2018-11-18 17:00:46,897 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 152 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2569 ImplicationChecksByTransitivity, 117.1s TimeCoverageRelationStatistics Valid=1355, Invalid=8300, Unknown=47, NotChecked=0, Total=9702 [2018-11-18 17:00:46,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-11-18 17:00:46,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 228. [2018-11-18 17:00:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-11-18 17:00:46,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 288 transitions. [2018-11-18 17:00:46,921 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 288 transitions. Word has length 59 [2018-11-18 17:00:46,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:00:46,921 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 288 transitions. [2018-11-18 17:00:46,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-18 17:00:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 288 transitions. [2018-11-18 17:00:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 17:00:46,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:00:46,922 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:00:46,922 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:00:46,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:00:46,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1774439429, now seen corresponding path program 2 times [2018-11-18 17:00:46,923 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:00:46,923 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:00:46,936 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 17:00:47,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 17:00:47,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:00:47,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:00:47,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 17:00:47,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-11-18 17:00:47,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:00:47,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:00:47,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 17:00:47,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-11-18 17:00:47,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:00:47,085 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:00:47,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:00:47,090 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-11-18 17:00:47,103 INFO L477 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 9 treesize of output 7 [2018-11-18 17:00:47,105 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 17:00:47,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:00:47,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:00:47,115 INFO L477 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 9 treesize of output 7 [2018-11-18 17:00:47,117 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 17:00:47,117 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:00:47,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:00:47,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:00:47,123 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:10 [2018-11-18 17:00:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 17:00:47,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:00:47,472 INFO L477 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 16 treesize of output 14 [2018-11-18 17:00:47,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2018-11-18 17:00:47,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:00:47,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:00:47,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:00:47,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:5 [2018-11-18 17:00:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 17:00:47,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:00:47,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-11-18 17:00:47,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 17:00:47,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 17:00:47,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-11-18 17:00:47,546 INFO L87 Difference]: Start difference. First operand 228 states and 288 transitions. Second operand 19 states. [2018-11-18 17:00:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:00:48,487 INFO L93 Difference]: Finished difference Result 319 states and 403 transitions. [2018-11-18 17:00:48,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 17:00:48,488 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-11-18 17:00:48,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:00:48,489 INFO L225 Difference]: With dead ends: 319 [2018-11-18 17:00:48,490 INFO L226 Difference]: Without dead ends: 168 [2018-11-18 17:00:48,490 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2018-11-18 17:00:48,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-18 17:00:48,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2018-11-18 17:00:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-18 17:00:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 199 transitions. [2018-11-18 17:00:48,511 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 199 transitions. Word has length 62 [2018-11-18 17:00:48,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:00:48,511 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 199 transitions. [2018-11-18 17:00:48,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 17:00:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 199 transitions. [2018-11-18 17:00:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 17:00:48,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:00:48,512 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:00:48,512 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:00:48,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:00:48,512 INFO L82 PathProgramCache]: Analyzing trace with hash -605968205, now seen corresponding path program 3 times [2018-11-18 17:00:48,512 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:00:48,512 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:00:48,525 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 17:00:48,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 17:00:48,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:00:48,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:00:48,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-18 17:00:48,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2018-11-18 17:00:48,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:00:48,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:00:48,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:00:48,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-18 17:00:48,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-18 17:00:48,768 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:00:48,769 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 17:00:48,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:00:48,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:00:48,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:00:48,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-18 17:00:48,866 INFO L477 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 17 treesize of output 13 [2018-11-18 17:00:48,868 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:00:48,868 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 17:00:48,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:00:48,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:00:48,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:00:48,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:7 [2018-11-18 17:01:14,865 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-18 17:01:14,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-18 17:01:14,874 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:01:14,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-11-18 17:01:14,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:01:14,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:01:14,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:01:14,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:16 [2018-11-18 17:01:16,878 INFO L477 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 7 treesize of output 5 [2018-11-18 17:01:16,879 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-18 17:01:16,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:01:16,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:01:16,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:01:16,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-18 17:01:20,934 INFO L477 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 11 [2018-11-18 17:01:20,935 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 17:01:20,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:01:20,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:01:20,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:01:20,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-18 17:01:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 31 refuted. 2 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 17:01:20,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:01:21,500 INFO L477 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 16 treesize of output 14 [2018-11-18 17:01:21,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 14 treesize of output 18 [2018-11-18 17:01:21,506 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 17:01:21,506 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:01:21,507 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:01:21,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:01:21,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:01:21,509 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-18 17:01:21,673 INFO L477 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 23 treesize of output 21 [2018-11-18 17:01:21,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 25 [2018-11-18 17:01:21,700 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:01:21,701 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 17:01:21,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-18 17:01:21,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:01:21,702 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-18 17:01:21,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:01:21,706 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:01:21,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:01:21,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:01:21,713 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:18 [2018-11-18 17:01:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:01:21,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:01:21,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2018-11-18 17:01:21,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-18 17:01:21,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-18 17:01:21,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1092, Unknown=16, NotChecked=0, Total=1260 [2018-11-18 17:01:21,797 INFO L87 Difference]: Start difference. First operand 164 states and 199 transitions. Second operand 36 states. [2018-11-18 17:01:36,872 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 30 [2018-11-18 17:01:41,104 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 27 [2018-11-18 17:01:53,039 WARN L180 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-11-18 17:02:00,151 WARN L180 SmtUtils]: Spent 3.48 s on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-11-18 17:02:03,437 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-11-18 17:02:12,490 WARN L180 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-11-18 17:02:16,066 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-18 17:02:24,566 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 17:02:36,920 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-18 17:02:41,918 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-18 17:02:55,592 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-18 17:03:02,337 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 38 [2018-11-18 17:03:17,094 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-18 17:05:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:05:12,800 INFO L93 Difference]: Finished difference Result 372 states and 476 transitions. [2018-11-18 17:05:12,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-18 17:05:12,801 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 62 [2018-11-18 17:05:12,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:05:12,802 INFO L225 Difference]: With dead ends: 372 [2018-11-18 17:05:12,802 INFO L226 Difference]: Without dead ends: 289 [2018-11-18 17:05:12,803 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 123.7s TimeCoverageRelationStatistics Valid=763, Invalid=4872, Unknown=65, NotChecked=0, Total=5700 [2018-11-18 17:05:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-11-18 17:05:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 179. [2018-11-18 17:05:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-18 17:05:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 217 transitions. [2018-11-18 17:05:12,824 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 217 transitions. Word has length 62 [2018-11-18 17:05:12,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:05:12,824 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 217 transitions. [2018-11-18 17:05:12,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-18 17:05:12,825 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 217 transitions. [2018-11-18 17:05:12,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 17:05:12,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:05:12,825 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:05:12,826 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:05:12,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:12,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1223812645, now seen corresponding path program 2 times [2018-11-18 17:05:12,826 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:05:12,827 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:05:12,840 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 17:05:12,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 17:05:12,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:05:12,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:12,964 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 17:05:12,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:05:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 17:05:12,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:05:12,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-18 17:05:13,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 17:05:13,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 17:05:13,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:05:13,000 INFO L87 Difference]: Start difference. First operand 179 states and 217 transitions. Second operand 8 states. [2018-11-18 17:05:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:05:13,047 INFO L93 Difference]: Finished difference Result 283 states and 349 transitions. [2018-11-18 17:05:13,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:05:13,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-11-18 17:05:13,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:05:13,049 INFO L225 Difference]: With dead ends: 283 [2018-11-18 17:05:13,049 INFO L226 Difference]: Without dead ends: 175 [2018-11-18 17:05:13,049 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:05:13,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-18 17:05:13,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2018-11-18 17:05:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-18 17:05:13,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 190 transitions. [2018-11-18 17:05:13,064 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 190 transitions. Word has length 63 [2018-11-18 17:05:13,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:05:13,065 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 190 transitions. [2018-11-18 17:05:13,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 17:05:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 190 transitions. [2018-11-18 17:05:13,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 17:05:13,066 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:05:13,066 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:05:13,066 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:05:13,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:13,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1476171290, now seen corresponding path program 1 times [2018-11-18 17:05:13,066 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:05:13,066 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:05:13,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:05:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:05:13,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:13,397 INFO L477 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 18 [2018-11-18 17:05:13,399 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-18 17:05:13,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:05:13,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:13,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:13,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2018-11-18 17:05:13,433 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 17:05:13,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:05:13,551 INFO L477 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 17 treesize of output 13 [2018-11-18 17:05:13,553 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 17:05:13,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:05:13,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:13,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:13,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:4 [2018-11-18 17:05:13,634 INFO L477 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 20 treesize of output 16 [2018-11-18 17:05:13,643 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-11-18 17:05:13,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 17:05:13,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:05:13,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:05:13,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:11 [2018-11-18 17:05:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 17:05:13,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:05:13,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2018-11-18 17:05:13,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-18 17:05:13,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-18 17:05:13,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2018-11-18 17:05:13,888 INFO L87 Difference]: Start difference. First operand 170 states and 190 transitions. Second operand 32 states. [2018-11-18 17:05:15,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:05:15,705 INFO L93 Difference]: Finished difference Result 222 states and 246 transitions. [2018-11-18 17:05:15,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 17:05:15,706 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-11-18 17:05:15,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:05:15,706 INFO L225 Difference]: With dead ends: 222 [2018-11-18 17:05:15,706 INFO L226 Difference]: Without dead ends: 200 [2018-11-18 17:05:15,707 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=198, Invalid=1608, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 17:05:15,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-18 17:05:15,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 183. [2018-11-18 17:05:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-18 17:05:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 205 transitions. [2018-11-18 17:05:15,728 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 205 transitions. Word has length 71 [2018-11-18 17:05:15,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:05:15,728 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 205 transitions. [2018-11-18 17:05:15,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-18 17:05:15,729 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 205 transitions. [2018-11-18 17:05:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 17:05:15,729 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:05:15,729 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:05:15,730 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:05:15,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:15,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1345908390, now seen corresponding path program 2 times [2018-11-18 17:05:15,730 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:05:15,730 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:05:15,747 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 17:05:15,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 17:05:15,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:05:15,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:16,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 17:05:16,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-11-18 17:05:16,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:05:16,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:16,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:16,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-18 17:05:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 17:05:16,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:05:16,591 INFO L477 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 16 treesize of output 14 [2018-11-18 17:05:16,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 treesize of output 3 [2018-11-18 17:05:16,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:05:16,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:05:16,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:05:16,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-11-18 17:05:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:05:16,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:05:16,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2018-11-18 17:05:16,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-18 17:05:16,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-18 17:05:16,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 17:05:16,908 INFO L87 Difference]: Start difference. First operand 183 states and 205 transitions. Second operand 35 states. [2018-11-18 17:05:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:05:19,148 INFO L93 Difference]: Finished difference Result 272 states and 294 transitions. [2018-11-18 17:05:19,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 17:05:19,149 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 71 [2018-11-18 17:05:19,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:05:19,150 INFO L225 Difference]: With dead ends: 272 [2018-11-18 17:05:19,150 INFO L226 Difference]: Without dead ends: 212 [2018-11-18 17:05:19,150 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=312, Invalid=2550, Unknown=0, NotChecked=0, Total=2862 [2018-11-18 17:05:19,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-18 17:05:19,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 189. [2018-11-18 17:05:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-18 17:05:19,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 208 transitions. [2018-11-18 17:05:19,167 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 208 transitions. Word has length 71 [2018-11-18 17:05:19,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:05:19,167 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 208 transitions. [2018-11-18 17:05:19,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-18 17:05:19,167 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 208 transitions. [2018-11-18 17:05:19,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 17:05:19,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:05:19,167 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:05:19,168 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:05:19,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:19,168 INFO L82 PathProgramCache]: Analyzing trace with hash -147356705, now seen corresponding path program 3 times [2018-11-18 17:05:19,168 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:05:19,168 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:05:19,180 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 17:05:19,371 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 17:05:19,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:05:19,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:19,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-18 17:05:19,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2018-11-18 17:05:19,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:05:19,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:19,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-18 17:05:19,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2018-11-18 17:05:19,427 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:05:19,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:19,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:19,436 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-11-18 17:05:19,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-18 17:05:19,474 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:05:19,474 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 17:05:19,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:05:19,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:19,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-18 17:05:19,498 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:05:19,498 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 17:05:19,499 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:05:19,503 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:19,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:19,514 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-11-18 17:05:19,535 INFO L477 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 17 treesize of output 13 [2018-11-18 17:05:19,537 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:05:19,538 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 17:05:19,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:05:19,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:19,554 INFO L477 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 17 treesize of output 13 [2018-11-18 17:05:19,556 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:05:19,556 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 17:05:19,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:05:19,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:19,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:19,562 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:10 [2018-11-18 17:05:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 17:05:19,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:05:19,861 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 17:05:19,914 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-18 17:05:19,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:05:19,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:19,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:1 [2018-11-18 17:05:19,969 INFO L477 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 22 treesize of output 20 [2018-11-18 17:05:19,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 20 treesize of output 24 [2018-11-18 17:05:19,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-18 17:05:19,988 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:05:19,991 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:19,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:20,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:20,001 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:45, output treesize:15 [2018-11-18 17:05:20,030 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 6 proven. 41 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 17:05:20,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:05:20,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-11-18 17:05:20,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 17:05:20,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 17:05:20,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-11-18 17:05:20,032 INFO L87 Difference]: Start difference. First operand 189 states and 208 transitions. Second operand 19 states. [2018-11-18 17:05:20,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:05:20,770 INFO L93 Difference]: Finished difference Result 213 states and 236 transitions. [2018-11-18 17:05:20,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 17:05:20,771 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 71 [2018-11-18 17:05:20,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:05:20,771 INFO L225 Difference]: With dead ends: 213 [2018-11-18 17:05:20,771 INFO L226 Difference]: Without dead ends: 87 [2018-11-18 17:05:20,772 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2018-11-18 17:05:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-18 17:05:20,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2018-11-18 17:05:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-18 17:05:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-11-18 17:05:20,784 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 71 [2018-11-18 17:05:20,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:05:20,785 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-11-18 17:05:20,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 17:05:20,785 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-11-18 17:05:20,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 17:05:20,785 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:05:20,785 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:05:20,786 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:05:20,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:05:20,786 INFO L82 PathProgramCache]: Analyzing trace with hash -280484243, now seen corresponding path program 3 times [2018-11-18 17:05:20,786 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:05:20,786 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:05:20,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 17:05:21,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 17:05:21,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:05:21,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:05:21,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 17:05:21,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-11-18 17:05:21,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:05:21,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:21,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:21,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-18 17:05:21,155 INFO L477 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 11 treesize of output 9 [2018-11-18 17:05:21,157 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-11-18 17:05:21,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:05:21,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:21,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:21,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:7 [2018-11-18 17:05:21,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-18 17:05:21,203 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:05:21,204 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:05:21,204 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-11-18 17:05:21,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:05:21,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:21,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:21,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-18 17:05:21,269 INFO L477 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 26 treesize of output 20 [2018-11-18 17:05:21,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:05:21,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2018-11-18 17:05:21,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:05:21,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:21,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:21,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:5 [2018-11-18 17:05:21,291 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 17:05:21,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:05:21,476 INFO L477 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 16 treesize of output 14 [2018-11-18 17:05:21,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 5 [2018-11-18 17:05:21,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:05:21,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:21,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:05:21,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-11-18 17:05:21,542 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 17:05:21,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:05:21,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2018-11-18 17:05:21,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 17:05:21,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 17:05:21,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-11-18 17:05:21,545 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 20 states. [2018-11-18 17:05:22,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:05:22,453 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-11-18 17:05:22,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 17:05:22,453 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 75 [2018-11-18 17:05:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:05:22,453 INFO L225 Difference]: With dead ends: 76 [2018-11-18 17:05:22,453 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 17:05:22,454 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 17:05:22,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 17:05:22,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 17:05:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 17:05:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 17:05:22,455 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2018-11-18 17:05:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:05:22,455 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 17:05:22,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 17:05:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 17:05:22,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 17:05:22,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 17:05:22,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:05:22,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:05:22,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:05:22,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:05:22,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:05:22,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:05:22,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:05:22,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:05:22,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:05:23,048 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 55 [2018-11-18 17:05:23,310 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 58 [2018-11-18 17:05:24,514 WARN L180 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 152 DAG size of output: 88 [2018-11-18 17:05:24,655 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2018-11-18 17:05:25,001 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-11-18 17:05:25,165 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 43 [2018-11-18 17:05:25,302 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 45 [2018-11-18 17:05:25,738 INFO L421 ceAbstractionStarter]: At program point initENTRY(lines 15 21) the Hoare annotation is: (let ((.cse1 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse1 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32))) (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (not (= (_ bv0 32) (select .cse1 .cse2))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select .cse0 .cse2) (_ bv0 32))))) [2018-11-18 17:05:25,738 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 17 20) no Hoare annotation was computed. [2018-11-18 17:05:25,738 INFO L425 ceAbstractionStarter]: For program point L17-3(lines 17 20) no Hoare annotation was computed. [2018-11-18 17:05:25,738 INFO L421 ceAbstractionStarter]: At program point L17-4(lines 17 20) the Hoare annotation is: (let ((.cse5 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse1 (select .cse5 |~#pp~0.offset|)) (.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse3 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= .cse1 (_ bv0 32))) (not (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse4 (select |#memory_$Pointer$.base| |~#pp~0.base|))) (and (= (select .cse2 |~#pp~0.offset|) .cse1) (= (_ bv0 32) (select .cse2 .cse3)) (= (_ bv0 32) (select .cse4 |~#pp~0.offset|)) (= (select .cse4 .cse3) (_ bv0 32)))) (not (= (_ bv0 32) (select .cse5 .cse3))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select .cse0 .cse3) (_ bv0 32)))))) [2018-11-18 17:05:25,738 INFO L425 ceAbstractionStarter]: For program point initEXIT(lines 15 21) no Hoare annotation was computed. [2018-11-18 17:05:25,738 INFO L425 ceAbstractionStarter]: For program point L17-5(lines 15 21) no Hoare annotation was computed. [2018-11-18 17:05:25,739 INFO L425 ceAbstractionStarter]: For program point mallocFINAL(lines 46 49) no Hoare annotation was computed. [2018-11-18 17:05:25,739 INFO L425 ceAbstractionStarter]: For program point mallocEXIT(lines 46 49) no Hoare annotation was computed. [2018-11-18 17:05:25,739 INFO L421 ceAbstractionStarter]: At program point mallocENTRY(lines 46 49) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse3 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (= |old(~counter~0)| ~counter~0) (let ((.cse1 (select .cse2 |~#pp~0.offset|))) (or (not (= .cse1 (_ bv0 32))) (= .cse1 |old(~counter~0)|))) (not (= (_ bv0 32) (select .cse2 .cse3))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select .cse0 .cse3) (_ bv0 32))))) [2018-11-18 17:05:25,739 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:05:25,739 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (let ((.cse8 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse7 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse5 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse2 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse4 (= (_ bv0 32) (select .cse7 .cse5))) (.cse3 (= (select .cse8 .cse5) (_ bv0 32))) (.cse1 (select .cse8 |~#pp~0.offset|))) (and (or (not (= (_ bv0 32) (select .cse0 |~#pp~0.offset|))) (not (= (_ bv0 32) .cse1)) (= (_ bv0 32) (select .cse2 |~#pp~0.offset|))) (or (not .cse3) (and .cse4 (= (select .cse2 .cse5) (_ bv0 32))) (not (= (select .cse0 .cse5) (_ bv0 32)))) (= |old(~counter~0)| ~counter~0) (let ((.cse6 (bvadd |~#pstate~0.offset| (_ bv4 32)))) (or (= (bvadd (select (select |#memory_int| |~#pstate~0.base|) .cse6) (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv1 32) (select (select |old(#memory_int)| |~#pstate~0.base|) .cse6))))) (or (not .cse4) .cse3) (= (select .cse7 |~#pp~0.offset|) .cse1)))) [2018-11-18 17:05:25,739 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:05:25,739 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2018-11-18 17:05:25,739 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 25 31) no Hoare annotation was computed. [2018-11-18 17:05:25,739 INFO L425 ceAbstractionStarter]: For program point L25-3(lines 25 31) no Hoare annotation was computed. [2018-11-18 17:05:25,739 INFO L421 ceAbstractionStarter]: At program point L25-4(lines 25 31) the Hoare annotation is: (let ((.cse10 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse11 (bvadd |~#pp~0.offset| (_ bv4 32))) (.cse12 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse0 (= |old(#memory_int)| |#memory_int|)) (.cse4 (= f_~i~1 (_ bv0 32))) (.cse1 (= |f_#in~pointer.offset| f_~pointer.offset)) (.cse2 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse3 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (.cse8 (select .cse12 |~#pp~0.offset|)) (.cse5 (not (= (_ bv0 32) (select .cse12 .cse11)))) (.cse6 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse7 (not (= (_ bv0 32) |~#pp~0.offset|))) (.cse9 (not (= (select .cse10 .cse11) (_ bv0 32))))) (and (or (not (= (_ bv1 32) (select (select |old(#memory_int)| |~#pstate~0.base|) |~#pstate~0.offset|))) (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 (not (= (bvadd .cse8 (_ bv4294967295 32)) (_ bv0 32))) .cse9 (and .cse0 .cse1 .cse2 (= (bvadd f_~i~1 (_ bv4294967295 32)) (_ bv0 32)) .cse3)) (or (not (= (select .cse10 |~#pp~0.offset|) (_ bv0 32))) (and .cse0 .cse4 .cse1 .cse2 .cse3) (not (= .cse8 (_ bv0 32))) .cse5 .cse6 .cse7 .cse9)))) [2018-11-18 17:05:25,740 INFO L425 ceAbstractionStarter]: For program point L25-5(lines 23 32) no Hoare annotation was computed. [2018-11-18 17:05:25,740 INFO L425 ceAbstractionStarter]: For program point fEXIT(lines 23 32) no Hoare annotation was computed. [2018-11-18 17:05:25,740 INFO L421 ceAbstractionStarter]: At program point fENTRY(lines 23 32) the Hoare annotation is: (let ((.cse6 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse7 (bvadd |~#pp~0.offset| (_ bv4 32))) (.cse8 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse4 (select .cse8 |~#pp~0.offset|)) (.cse1 (not (= (_ bv0 32) (select .cse8 .cse7)))) (.cse2 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse3 (not (= (_ bv0 32) |~#pp~0.offset|))) (.cse0 (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (.cse5 (not (= (select .cse6 .cse7) (_ bv0 32))))) (and (or .cse0 (not (= (_ bv1 32) (select (select |old(#memory_int)| |~#pstate~0.base|) |~#pstate~0.offset|))) .cse1 .cse2 .cse3 (not (= (bvadd .cse4 (_ bv4294967295 32)) (_ bv0 32))) .cse5) (or (not (= (select .cse6 |~#pp~0.offset|) (_ bv0 32))) (not (= .cse4 (_ bv0 32))) .cse1 .cse2 .cse3 .cse0 .cse5)))) [2018-11-18 17:05:25,740 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 36 42) no Hoare annotation was computed. [2018-11-18 17:05:25,740 INFO L425 ceAbstractionStarter]: For program point L36-3(lines 36 42) no Hoare annotation was computed. [2018-11-18 17:05:25,740 INFO L421 ceAbstractionStarter]: At program point L36-4(lines 36 42) the Hoare annotation is: (let ((.cse20 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse17 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse11 (bvadd |~#pstate~0.offset| (_ bv4 32))) (.cse14 (select .cse17 (bvadd |~#pp~0.offset| (_ bv4 32)))) (.cse18 (bvmul (_ bv4 32) g_~i~2)) (.cse19 (select .cse20 |~#pstate~0.offset|))) (let ((.cse0 (not (= (_ bv1 32) .cse19))) (.cse4 (select |#memory_int| |~#pstate~0.base|)) (.cse5 (bvadd .cse18 |~#pstate~0.offset|)) (.cse9 (= |old(#memory_int)| |#memory_int|)) (.cse16 (select .cse17 |~#pp~0.offset|)) (.cse1 (= (_ bv2 32) g_~i~2)) (.cse3 (= (bvadd g_~i~2 (_ bv4294967295 32)) (_ bv0 32))) (.cse15 (= |g_#in~pointer.offset| .cse14)) (.cse2 (not (= (_ bv1 32) (select .cse20 .cse11)))) (.cse6 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse12 (= (store |old(#memory_int)| |~#pstate~0.base| (store .cse20 |~#pstate~0.offset| (_ bv2 32))) |#memory_int|)) (.cse8 (= g_~i~2 (_ bv0 32))) (.cse13 (= |g_#in~pointer.offset| g_~pointer.offset)) (.cse7 (not (= (_ bv0 32) |~#pp~0.offset|)))) (and (or .cse0 .cse1 .cse2 (and .cse3 (= (bvadd (select .cse4 .cse5) (_ bv4294967295 32)) (_ bv0 32))) .cse6 .cse7 (and .cse8 .cse9)) (let ((.cse10 (= |g_#in~pointer.offset| .cse16))) (or .cse0 (and .cse10 (= (bvadd (select (store .cse4 .cse5 (_ bv2 32)) .cse11) (_ bv4294967295 32)) (_ bv0 32)) .cse12) .cse2 (and .cse9 .cse1) (and .cse9 .cse13) .cse6 (not (= (_ bv2 32) .cse14)) .cse7 (and .cse1 .cse15) (and .cse12 .cse10 .cse13))) (or (or (not (= (bvadd .cse16 (_ bv1 32)) |g_#in~pointer.offset|)) (not (= (bvadd .cse16 (_ bv4294967295 32)) (_ bv0 32)))) .cse1 (and .cse3 (or (not (= (select .cse17 (bvadd .cse18 |~#pp~0.offset|)) g_~pointer.offset)) (or (not (= (select .cse17 (bvadd .cse18 |~#pp~0.offset| (_ bv4 32))) g_~pointer.offset)) .cse15)) .cse12) .cse2 .cse6 (and .cse12 .cse8 .cse13) .cse7 (not (= (_ bv2 32) .cse19))))))) [2018-11-18 17:05:25,740 INFO L425 ceAbstractionStarter]: For program point L36-5(lines 34 43) no Hoare annotation was computed. [2018-11-18 17:05:25,740 INFO L425 ceAbstractionStarter]: For program point gEXIT(lines 34 43) no Hoare annotation was computed. [2018-11-18 17:05:25,740 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-18 17:05:25,740 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-18 17:05:25,741 INFO L421 ceAbstractionStarter]: At program point L39-2(line 39) the Hoare annotation is: (let ((.cse5 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse1 (not (= (_ bv1 32) (select .cse5 (bvadd |~#pstate~0.offset| (_ bv4 32)))))) (.cse2 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse3 (not (= (_ bv0 32) |~#pp~0.offset|))) (.cse0 (select .cse5 |~#pstate~0.offset|))) (and (or (not (= (_ bv1 32) .cse0)) .cse1 .cse2 .cse3) (or (let ((.cse4 (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) |~#pp~0.offset|))) (or (not (= (bvadd .cse4 (_ bv1 32)) |g_#in~pointer.offset|)) (not (= (bvadd .cse4 (_ bv4294967295 32)) (_ bv0 32))))) .cse1 .cse2 .cse3 (not (= (_ bv2 32) .cse0)))))) [2018-11-18 17:05:25,741 INFO L421 ceAbstractionStarter]: At program point gENTRY(lines 34 43) the Hoare annotation is: (let ((.cse1 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse5 (select .cse1 |~#pstate~0.offset|)) (.cse2 (not (= (_ bv1 32) (select .cse1 (bvadd |~#pstate~0.offset| (_ bv4 32)))))) (.cse3 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse4 (not (= (_ bv0 32) |~#pp~0.offset|)))) (and (or (let ((.cse0 (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) |~#pp~0.offset|))) (or (not (= (bvadd .cse0 (_ bv1 32)) |g_#in~pointer.offset|)) (not (= (bvadd .cse0 (_ bv4294967295 32)) (_ bv0 32))))) (= (store |old(#memory_int)| |~#pstate~0.base| (store .cse1 |~#pstate~0.offset| (_ bv2 32))) |#memory_int|) .cse2 .cse3 .cse4 (not (= (_ bv2 32) .cse5))) (or (= |old(#memory_int)| |#memory_int|) (not (= (_ bv1 32) .cse5)) .cse2 .cse3 .cse4)))) [2018-11-18 17:05:25,741 INFO L425 ceAbstractionStarter]: For program point L39-3(line 39) no Hoare annotation was computed. [2018-11-18 17:05:25,741 INFO L425 ceAbstractionStarter]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-18 17:05:25,741 INFO L425 ceAbstractionStarter]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2018-11-18 17:05:25,741 INFO L425 ceAbstractionStarter]: For program point __blast_assertFINAL(lines 4 7) no Hoare annotation was computed. [2018-11-18 17:05:25,741 INFO L428 ceAbstractionStarter]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2018-11-18 17:05:25,741 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:05:25,741 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse2 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse1 (bvadd |~#pp~0.offset| (_ bv4 32)))) (and (= |~#pstate~0.offset| (_ bv0 32)) (= (_ bv0 32) (select .cse0 |~#pp~0.offset|)) (= (_ bv0 32) |~#pp~0.offset|) (= (_ bv0 32) (select .cse0 .cse1)) (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse2 |~#pp~0.offset|)) (= (select .cse2 .cse1) (_ bv0 32)))) [2018-11-18 17:05:25,741 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 17:05:25,741 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:05:25,742 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-18 17:05:25,742 INFO L421 ceAbstractionStarter]: At program point L62(line 62) the Hoare annotation is: (let ((.cse6 (select |#memory_int| |~#pstate~0.base|))) (let ((.cse0 (= (bvadd (select .cse6 (bvadd |~#pstate~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (.cse1 (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32))) (.cse2 (select .cse6 |~#pstate~0.offset|)) (.cse4 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse3 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse5 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (and .cse0 .cse1 (= (_ bv1 32) .cse2)) (not (= (select .cse3 |~#pp~0.offset|) (_ bv0 32))) (and (not (= main_~a~0.offset ~counter~0)) .cse0 (= (bvadd main_~a~0.offset (_ bv1 32)) main_~b~0.offset) (= (_ bv1 32) (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) |~#pp~0.offset|)) .cse1 (= (_ bv2 32) .cse2)) (not (= (select .cse4 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv0 32) (select .cse4 .cse5))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select .cse3 .cse5) (_ bv0 32)))))) [2018-11-18 17:05:25,742 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 51 69) the Hoare annotation is: (let ((.cse1 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse1 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (not (= (_ bv0 32) (select .cse1 .cse2))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select .cse0 .cse2) (_ bv0 32))))) [2018-11-18 17:05:25,742 INFO L421 ceAbstractionStarter]: At program point L61(line 61) the Hoare annotation is: (let ((.cse4 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse3 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (let ((.cse1 (bvadd main_~a~0.offset (_ bv1 32))) (.cse0 (select |#memory_int| |~#pstate~0.base|))) (and (not (= main_~a~0.offset ~counter~0)) (= (bvadd (select .cse0 (bvadd |~#pstate~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= .cse1 (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) .cse2)) (= .cse1 main_~b~0.offset) (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) (select .cse0 |~#pstate~0.offset|)))) (not (= (select .cse3 |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse4 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv0 32) (select .cse4 .cse2))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select .cse3 .cse2) (_ bv0 32))))) [2018-11-18 17:05:25,742 INFO L421 ceAbstractionStarter]: At program point L60(line 60) the Hoare annotation is: (let ((.cse5 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse1 (select .cse5 |~#pp~0.offset|)) (.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse3 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= .cse1 (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse4 (select |#memory_$Pointer$.base| |~#pp~0.base|))) (and (not (= main_~a~0.offset ~counter~0)) (= (bvadd main_~a~0.offset (_ bv1 32)) main_~b~0.offset) (let ((.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (_ bv0 32) (select .cse2 .cse3)) (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (select .cse2 |~#pp~0.offset|) .cse1))) (= (_ bv0 32) (select .cse4 |~#pp~0.offset|)) (= (select .cse4 .cse3) (_ bv0 32)))) (not (= (_ bv0 32) (select .cse5 .cse3))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select .cse0 .cse3) (_ bv0 32)))))) [2018-11-18 17:05:25,743 INFO L421 ceAbstractionStarter]: At program point L60-1(line 60) the Hoare annotation is: (let ((.cse1 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse1 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv0 32) (select .cse1 .cse2))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select .cse0 .cse2) (_ bv0 32))) (let ((.cse3 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (not (= main_~a~0.offset ~counter~0)) (= (bvadd main_~a~0.offset (_ bv1 32)) main_~b~0.offset) (= (_ bv0 32) (select .cse3 .cse2)) (= (_ bv1 32) (select .cse3 |~#pp~0.offset|)) (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|)) (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse2) (_ bv0 32)))))) [2018-11-18 17:05:25,743 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 58) no Hoare annotation was computed. [2018-11-18 17:05:25,743 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 51 69) no Hoare annotation was computed. [2018-11-18 17:05:25,743 INFO L421 ceAbstractionStarter]: At program point L56(line 56) the Hoare annotation is: (let ((.cse5 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse1 (select .cse5 |~#pp~0.offset|)) (.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse3 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= .cse1 (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse4 (select |#memory_$Pointer$.base| |~#pp~0.base|))) (and (and (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (select .cse2 |~#pp~0.offset|) .cse1)) (= (_ bv0 32) (select .cse2 .cse3)) (= (bvadd ~counter~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse4 |~#pp~0.offset|)) (= (select .cse4 .cse3) (_ bv0 32)))) (not (= (_ bv0 32) (select .cse5 .cse3))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select .cse0 .cse3) (_ bv0 32)))))) [2018-11-18 17:05:25,743 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-18 17:05:25,743 INFO L425 ceAbstractionStarter]: For program point L56-1(line 56) no Hoare annotation was computed. [2018-11-18 17:05:25,743 INFO L421 ceAbstractionStarter]: At program point L54(line 54) the Hoare annotation is: (let ((.cse1 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse1 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (not (= (_ bv0 32) (select .cse1 .cse2))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select .cse0 .cse2) (_ bv0 32))))) [2018-11-18 17:05:25,743 INFO L421 ceAbstractionStarter]: At program point L54-1(line 54) the Hoare annotation is: (let ((.cse5 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse1 (select .cse5 |~#pp~0.offset|)) (.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse3 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= .cse1 (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse4 (select |#memory_$Pointer$.base| |~#pp~0.base|))) (and (= (select .cse2 |~#pp~0.offset|) .cse1) (= (_ bv0 32) (select .cse2 .cse3)) (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse4 |~#pp~0.offset|)) (= (select .cse4 .cse3) (_ bv0 32)))) (not (= (_ bv0 32) (select .cse5 .cse3))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select .cse0 .cse3) (_ bv0 32)))))) [2018-11-18 17:05:25,743 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 51 69) no Hoare annotation was computed. [2018-11-18 17:05:25,750 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,751 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,751 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,751 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,751 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,751 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,752 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,752 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,752 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,752 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,752 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,752 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,753 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,753 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,753 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,753 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,753 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,753 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,754 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,755 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,755 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,755 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,756 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,756 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,756 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,756 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,756 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,756 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,757 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,757 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,757 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,757 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,757 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,757 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,757 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,758 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,758 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,758 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,758 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,758 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,758 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,759 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,759 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,759 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,759 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,761 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,762 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,762 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,762 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,762 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,762 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,762 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,763 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,763 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,763 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,763 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,763 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,763 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,764 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,764 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,764 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,764 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,764 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,765 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,765 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,765 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,765 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,765 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,766 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,766 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,766 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,766 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,766 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,766 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,766 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,766 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,766 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,767 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,767 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,767 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,767 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,767 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,767 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,767 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,767 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,768 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,768 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,768 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,768 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,768 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,770 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,771 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,771 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,771 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,771 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,771 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,772 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,772 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,772 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,773 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,773 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,773 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,773 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,773 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,773 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,774 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,774 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,774 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,774 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,774 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,775 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,775 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,775 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,775 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,775 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,775 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,776 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,776 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,776 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,776 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,776 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,776 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,777 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,777 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,777 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,777 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,777 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,778 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,778 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,778 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,778 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,778 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,778 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,779 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,780 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,780 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,780 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,781 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,781 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,781 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,781 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,781 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,782 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,782 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,782 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,782 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,783 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,783 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,783 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,783 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,783 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,783 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,784 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,784 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,784 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,784 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,784 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,784 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,784 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,785 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,785 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,785 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,785 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,785 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,785 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,785 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,785 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,785 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,786 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,786 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,786 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,786 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,786 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,786 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,786 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,786 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,786 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,786 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,787 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,788 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,789 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,790 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,790 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,790 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,790 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,790 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,791 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,791 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,791 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,791 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,791 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,792 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,792 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,792 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,792 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,792 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,793 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,793 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,793 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,793 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,793 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,794 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,794 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,794 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,794 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,794 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,795 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,795 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,795 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,795 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,795 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,795 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,796 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,796 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:05:25 BoogieIcfgContainer [2018-11-18 17:05:25,797 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 17:05:25,798 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:05:25,798 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:05:25,798 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:05:25,798 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:53:39" (3/4) ... [2018-11-18 17:05:25,801 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 17:05:25,805 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init [2018-11-18 17:05:25,805 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure malloc [2018-11-18 17:05:25,805 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 17:05:25,805 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2018-11-18 17:05:25,806 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2018-11-18 17:05:25,806 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __blast_assert [2018-11-18 17:05:25,806 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 17:05:25,809 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2018-11-18 17:05:25,809 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-18 17:05:25,809 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 17:05:25,826 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(\old(#memory_$Pointer$)[pp][pp] == 0bv32) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || !(~bvadd64(counter, 4294967295bv32) == 0bv32)) || (((#memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp] && 0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) && 0bv32 == #memory_$Pointer$[pp][pp]) && #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)] == 0bv32)) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32) [2018-11-18 17:05:25,826 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate]) || ((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0bv32)) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || !(~bvadd64(\old(#memory_$Pointer$)[pp][pp], 4294967295bv32) == 0bv32)) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) || ((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && ~bvadd64(i, 4294967295bv32) == 0bv32) && \old(#memory_$Pointer$) == #memory_$Pointer$)) && ((((((!(\old(#memory_$Pointer$)[pp][pp] == 0bv32) || ((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && i == 0bv32) && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) [2018-11-18 17:05:25,826 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate]) || 2bv32 == i) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || (~bvadd64(i, 4294967295bv32) == 0bv32 && ~bvadd64(unknown-#memory_int-unknown[pstate][~bvadd64(~bvmul32(4bv32, i), pstate)], 4294967295bv32) == 0bv32)) || !(0bv32 == pstate)) || !(0bv32 == pp)) || (i == 0bv32 && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown)) && (((((((((!(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate]) || ((pointer == #memory_$Pointer$[pp][pp] && ~bvadd64(unknown-#memory_int-unknown[pstate][~bvadd64(~bvmul32(4bv32, i), pstate) := 2bv32][~bvadd64(pstate, 4bv32)], 4294967295bv32) == 0bv32) && \old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][pstate := 2bv32]] == unknown-#memory_int-unknown)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || (\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && 2bv32 == i)) || (\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer)) || !(0bv32 == pstate)) || !(2bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pp)) || (2bv32 == i && pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || ((\old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][pstate := 2bv32]] == unknown-#memory_int-unknown && pointer == #memory_$Pointer$[pp][pp]) && pointer == pointer))) && ((((((((!(~bvadd64(#memory_$Pointer$[pp][pp], 1bv32) == pointer) || !(~bvadd64(#memory_$Pointer$[pp][pp], 4294967295bv32) == 0bv32)) || 2bv32 == i) || ((~bvadd64(i, 4294967295bv32) == 0bv32 && (!(#memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp)] == pointer) || !(#memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp, 4bv32)] == pointer) || pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) && \old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][pstate := 2bv32]] == unknown-#memory_int-unknown)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || !(0bv32 == pstate)) || ((\old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][pstate := 2bv32]] == unknown-#memory_int-unknown && i == 0bv32) && pointer == pointer)) || !(0bv32 == pp)) || !(2bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) [2018-11-18 17:05:25,838 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c91a8e09-abf7-4d20-938f-8f2b10565643/bin-2019/uautomizer/witness.graphml [2018-11-18 17:05:25,838 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:05:25,839 INFO L168 Benchmark]: Toolchain (without parser) took 706460.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -126.7 MB). Peak memory consumption was 81.5 MB. Max. memory is 11.5 GB. [2018-11-18 17:05:25,839 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:05:25,839 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.57 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 17:05:25,840 INFO L168 Benchmark]: Boogie Preprocessor took 29.61 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:05:25,840 INFO L168 Benchmark]: RCFGBuilder took 321.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-18 17:05:25,840 INFO L168 Benchmark]: TraceAbstraction took 705869.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 407.5 MB. Max. memory is 11.5 GB. [2018-11-18 17:05:25,840 INFO L168 Benchmark]: Witness Printer took 40.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2018-11-18 17:05:25,841 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 196.57 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.61 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 321.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 705869.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 407.5 MB. Max. memory is 11.5 GB. * Witness Printer took 40.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant [2018-11-18 17:05:25,847 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,848 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,848 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,848 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,848 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,848 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,848 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,848 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,849 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,849 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,849 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,849 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,849 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,849 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,849 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,850 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,850 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,850 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,850 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,850 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,850 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,851 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,851 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,851 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,851 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,851 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,851 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,851 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,852 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,852 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,852 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,852 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,852 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,852 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,852 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,853 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,853 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,853 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,854 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,854 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,854 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,854 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,854 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,854 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,854 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,855 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,855 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,855 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,855 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,856 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,856 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,856 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,856 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,856 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,856 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,856 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,856 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,857 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,857 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,857 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,857 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,857 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,857 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,857 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,858 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,858 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,858 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,858 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,858 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,858 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,858 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,859 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,859 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,859 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,859 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,859 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,859 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,859 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,859 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,860 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,860 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,860 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,860 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,860 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,860 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,860 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,861 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,861 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,861 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,861 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((!(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate]) || ((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0bv32)) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || !(~bvadd64(\old(#memory_$Pointer$)[pp][pp], 4294967295bv32) == 0bv32)) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) || ((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && ~bvadd64(i, 4294967295bv32) == 0bv32) && \old(#memory_$Pointer$) == #memory_$Pointer$)) && ((((((!(\old(#memory_$Pointer$)[pp][pp] == 0bv32) || ((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && i == 0bv32) && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) - InvariantResult [Line: 36]: Loop Invariant [2018-11-18 17:05:25,862 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,862 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,863 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,863 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,863 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,863 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,863 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,863 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,864 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,864 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,864 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,864 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,864 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,864 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,864 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,865 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,865 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,865 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,865 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,865 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,865 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,866 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,866 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,866 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,866 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,866 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,866 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,866 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,866 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,867 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,867 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,867 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,867 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,867 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,867 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,867 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,868 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,868 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,868 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,868 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,868 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,868 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,868 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,869 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,869 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,869 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,870 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,870 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,870 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,870 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,870 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,871 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,871 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,871 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,871 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,871 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,871 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,871 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,872 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,872 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,872 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,872 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,872 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,872 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,873 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,873 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,873 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,873 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,873 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,873 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,873 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,874 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,874 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,874 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,874 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,874 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,874 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,874 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,875 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,875 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,875 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,875 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,875 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,875 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,875 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,875 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,876 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 17:05:25,876 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((!(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate]) || 2bv32 == i) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || (~bvadd64(i, 4294967295bv32) == 0bv32 && ~bvadd64(unknown-#memory_int-unknown[pstate][~bvadd64(~bvmul32(4bv32, i), pstate)], 4294967295bv32) == 0bv32)) || !(0bv32 == pstate)) || !(0bv32 == pp)) || (i == 0bv32 && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown)) && (((((((((!(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate]) || ((pointer == #memory_$Pointer$[pp][pp] && ~bvadd64(unknown-#memory_int-unknown[pstate][~bvadd64(~bvmul32(4bv32, i), pstate) := 2bv32][~bvadd64(pstate, 4bv32)], 4294967295bv32) == 0bv32) && \old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][pstate := 2bv32]] == unknown-#memory_int-unknown)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || (\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && 2bv32 == i)) || (\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer)) || !(0bv32 == pstate)) || !(2bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pp)) || (2bv32 == i && pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || ((\old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][pstate := 2bv32]] == unknown-#memory_int-unknown && pointer == #memory_$Pointer$[pp][pp]) && pointer == pointer))) && ((((((((!(~bvadd64(#memory_$Pointer$[pp][pp], 1bv32) == pointer) || !(~bvadd64(#memory_$Pointer$[pp][pp], 4294967295bv32) == 0bv32)) || 2bv32 == i) || ((~bvadd64(i, 4294967295bv32) == 0bv32 && (!(#memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp)] == pointer) || !(#memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp, 4bv32)] == pointer) || pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) && \old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][pstate := 2bv32]] == unknown-#memory_int-unknown)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || !(0bv32 == pstate)) || ((\old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][pstate := 2bv32]] == unknown-#memory_int-unknown && i == 0bv32) && pointer == pointer)) || !(0bv32 == pp)) || !(2bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) - InvariantResult [Line: 17]: Loop Invariant [2018-11-18 17:05:25,876 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,876 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,877 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,877 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,877 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,877 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,877 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,877 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,878 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,878 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,878 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,878 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,878 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,878 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,878 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,879 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,879 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,879 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,879 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,879 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,879 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,879 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,880 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,880 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,880 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,880 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 17:05:25,880 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 17:05:25,880 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,880 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,881 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,881 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,881 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,881 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,881 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,881 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 17:05:25,881 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((!(\old(#memory_$Pointer$)[pp][pp] == 0bv32) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || !(~bvadd64(counter, 4294967295bv32) == 0bv32)) || (((#memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp] && 0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) && 0bv32 == #memory_$Pointer$[pp][pp]) && #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)] == 0bv32)) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 51 locations, 1 error locations. SAFE Result, 705.7s OverallTime, 16 OverallIterations, 7 TraceHistogramMax, 632.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 792 SDtfs, 1978 SDslu, 2290 SDs, 0 SdLazy, 9600 SolverSat, 1196 SolverUnsat, 264 SolverUnknown, 0 SolverNotchecked, 447.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1957 GetRequests, 1480 SyntacticMatches, 7 SemanticMatches, 470 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5913 ImplicationChecksByTransitivity, 247.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=9, 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.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 308 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 213 PreInvPairs, 274 NumberOfFragments, 1837 HoareAnnotationTreeSize, 213 FomulaSimplifications, 15823 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 20 FomulaSimplificationsInter, 8637 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 67.2s InterpolantComputationTime, 990 NumberOfCodeBlocks, 965 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1705 ConstructedInterpolants, 11 QuantifiedInterpolants, 746261 SizeOfPredicates, 135 NumberOfNonLiveVariables, 2898 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 29 InterpolantComputations, 4 PerfectInterpolantSequences, 541/953 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...