./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-1dbac8b [2018-11-10 03:26:14,109 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:26:14,111 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:26:14,118 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:26:14,118 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:26:14,119 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:26:14,120 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:26:14,121 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:26:14,122 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:26:14,122 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:26:14,123 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:26:14,123 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:26:14,124 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:26:14,124 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:26:14,125 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:26:14,125 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:26:14,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:26:14,127 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:26:14,129 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:26:14,130 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:26:14,131 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:26:14,131 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:26:14,133 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:26:14,133 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:26:14,133 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:26:14,134 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:26:14,134 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:26:14,135 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:26:14,135 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:26:14,136 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:26:14,136 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:26:14,136 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:26:14,137 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:26:14,137 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:26:14,137 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:26:14,138 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:26:14,138 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 03:26:14,147 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:26:14,147 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:26:14,147 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:26:14,147 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 03:26:14,148 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:26:14,148 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:26:14,148 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:26:14,148 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:26:14,148 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:26:14,149 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:26:14,149 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:26:14,149 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:26:14,149 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:26:14,149 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:26:14,149 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:26:14,149 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:26:14,149 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:26:14,149 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:26:14,150 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:26:14,150 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:26:14,150 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:26:14,150 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:26:14,150 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:26:14,150 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:26:14,150 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:26:14,150 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:26:14,151 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:26:14,151 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:26:14,151 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 03:26:14,151 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_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:14,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:26:14,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:26:14,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:26:14,186 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:26:14,187 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:26:14,187 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-10 03:26:14,230 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/data/cb7cd957d/9105deb76dbf4b51b9c1e5f84f1737ad/FLAGb739bc5a3 [2018-11-10 03:26:14,566 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:26:14,566 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-10 03:26:14,571 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/data/cb7cd957d/9105deb76dbf4b51b9c1e5f84f1737ad/FLAGb739bc5a3 [2018-11-10 03:26:14,580 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/data/cb7cd957d/9105deb76dbf4b51b9c1e5f84f1737ad [2018-11-10 03:26:14,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:26:14,582 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 03:26:14,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:26:14,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:26:14,585 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:26:14,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:26:14" (1/1) ... [2018-11-10 03:26:14,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b497cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:14, skipping insertion in model container [2018-11-10 03:26:14,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:26:14" (1/1) ... [2018-11-10 03:26:14,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:26:14,606 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:26:14,706 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:26:14,710 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:26:14,722 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:26:14,734 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:26:14,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:14 WrapperNode [2018-11-10 03:26:14,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:26:14,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:26:14,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:26:14,735 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:26:14,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:14" (1/1) ... [2018-11-10 03:26:14,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:14" (1/1) ... [2018-11-10 03:26:14,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:14" (1/1) ... [2018-11-10 03:26:14,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:14" (1/1) ... [2018-11-10 03:26:14,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:14" (1/1) ... [2018-11-10 03:26:14,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:14" (1/1) ... [2018-11-10 03:26:14,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:14" (1/1) ... [2018-11-10 03:26:14,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:26:14,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:26:14,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:26:14,762 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:26:14,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:14,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:26:14,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:26:14,837 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-10 03:26:14,838 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-10 03:26:14,838 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-10 03:26:14,838 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-10 03:26:14,838 INFO L138 BoogieDeclarations]: Found implementation of procedure malloc [2018-11-10 03:26:14,838 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:26:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 03:26:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-10 03:26:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-10 03:26:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 03:26:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 03:26:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-10 03:26:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 03:26:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-10 03:26:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 03:26:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 03:26:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:26:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:26:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 03:26:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 03:26:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:26:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 03:26:15,091 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:26:15,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:26:15 BoogieIcfgContainer [2018-11-10 03:26:15,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:26:15,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:26:15,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:26:15,094 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:26:15,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:26:14" (1/3) ... [2018-11-10 03:26:15,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d16fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:26:15, skipping insertion in model container [2018-11-10 03:26:15,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:14" (2/3) ... [2018-11-10 03:26:15,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d16fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:26:15, skipping insertion in model container [2018-11-10 03:26:15,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:26:15" (3/3) ... [2018-11-10 03:26:15,096 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-10 03:26:15,102 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:26:15,106 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 03:26:15,114 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 03:26:15,132 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:26:15,132 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:26:15,132 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:26:15,132 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:26:15,132 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:26:15,133 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:26:15,133 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:26:15,133 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:26:15,133 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:26:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-11-10 03:26:15,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 03:26:15,149 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:15,150 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:15,151 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:15,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:15,155 INFO L82 PathProgramCache]: Analyzing trace with hash -935115767, now seen corresponding path program 1 times [2018-11-10 03:26:15,156 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:26:15,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:26:15,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:15,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:15,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:15,271 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-10 03:26:15,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:26:15,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:26:15,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 03:26:15,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 03:26:15,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 03:26:15,290 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-11-10 03:26:15,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:15,313 INFO L93 Difference]: Finished difference Result 110 states and 137 transitions. [2018-11-10 03:26:15,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 03:26:15,314 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 49 [2018-11-10 03:26:15,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:15,320 INFO L225 Difference]: With dead ends: 110 [2018-11-10 03:26:15,320 INFO L226 Difference]: Without dead ends: 59 [2018-11-10 03:26:15,322 INFO L605 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-10 03:26:15,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-10 03:26:15,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-10 03:26:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 03:26:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-11-10 03:26:15,347 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 49 [2018-11-10 03:26:15,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:15,347 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-11-10 03:26:15,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 03:26:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-10 03:26:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 03:26:15,349 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:15,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:15,350 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:15,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:15,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1553349029, now seen corresponding path program 1 times [2018-11-10 03:26:15,351 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:26:15,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:26:15,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:15,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:15,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:15,410 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-10 03:26:15,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:26:15,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:26:15,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:26:15,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:26:15,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:26:15,412 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 3 states. [2018-11-10 03:26:15,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:15,451 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2018-11-10 03:26:15,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:26:15,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-10 03:26:15,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:15,453 INFO L225 Difference]: With dead ends: 103 [2018-11-10 03:26:15,453 INFO L226 Difference]: Without dead ends: 64 [2018-11-10 03:26:15,454 INFO L605 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-10 03:26:15,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-10 03:26:15,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-11-10 03:26:15,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 03:26:15,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-11-10 03:26:15,461 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 52 [2018-11-10 03:26:15,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:15,461 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-11-10 03:26:15,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:26:15,461 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-11-10 03:26:15,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 03:26:15,462 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:15,463 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:15,463 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:15,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:15,463 INFO L82 PathProgramCache]: Analyzing trace with hash 737203684, now seen corresponding path program 1 times [2018-11-10 03:26:15,463 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:26:15,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:26:15,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:15,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:15,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:15,508 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-10 03:26:15,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:26:15,508 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:15,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:15,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:15,600 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-10 03:26:15,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:26:15,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-10 03:26:15,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:26:15,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:26:15,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:26:15,617 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 4 states. [2018-11-10 03:26:15,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:15,642 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2018-11-10 03:26:15,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:26:15,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-11-10 03:26:15,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:15,645 INFO L225 Difference]: With dead ends: 98 [2018-11-10 03:26:15,645 INFO L226 Difference]: Without dead ends: 70 [2018-11-10 03:26:15,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 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-10 03:26:15,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-10 03:26:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2018-11-10 03:26:15,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-10 03:26:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-11-10 03:26:15,654 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 57 [2018-11-10 03:26:15,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:15,655 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-11-10 03:26:15,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:26:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-10 03:26:15,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 03:26:15,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:15,656 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:15,657 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:15,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:15,657 INFO L82 PathProgramCache]: Analyzing trace with hash -2096168848, now seen corresponding path program 1 times [2018-11-10 03:26:15,657 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:26:15,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:26:15,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:15,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:15,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 03:26:15,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:26:15,722 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:15,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:15,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 03:26:15,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:26:15,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 03:26:15,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:26:15,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:26:15,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:26:15,816 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2018-11-10 03:26:15,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:15,857 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2018-11-10 03:26:15,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:26:15,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-10 03:26:15,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:15,859 INFO L225 Difference]: With dead ends: 109 [2018-11-10 03:26:15,859 INFO L226 Difference]: Without dead ends: 68 [2018-11-10 03:26:15,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 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-10 03:26:15,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-10 03:26:15,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-10 03:26:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 03:26:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-11-10 03:26:15,865 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 65 [2018-11-10 03:26:15,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:15,865 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-11-10 03:26:15,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:26:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-11-10 03:26:15,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 03:26:15,866 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:15,866 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:15,867 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:15,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:15,867 INFO L82 PathProgramCache]: Analyzing trace with hash 745092999, now seen corresponding path program 2 times [2018-11-10 03:26:15,867 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:26:15,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:26:15,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:15,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:15,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 03:26:16,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:26:16,253 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:16,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:26:16,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 03:26:16,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:26:16,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:16,354 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-10 03:26:16,356 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-10 03:26:16,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:16,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:16,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:16,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-10 03:26:16,402 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-10 03:26:16,404 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-10 03:26:16,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:16,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:16,407 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-10 03:26:16,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 03:26:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 03:26:16,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:26:16,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2018-11-10 03:26:16,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 03:26:16,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 03:26:16,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2018-11-10 03:26:16,458 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 23 states. [2018-11-10 03:26:17,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:17,454 INFO L93 Difference]: Finished difference Result 184 states and 214 transitions. [2018-11-10 03:26:17,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-10 03:26:17,454 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-11-10 03:26:17,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:17,455 INFO L225 Difference]: With dead ends: 184 [2018-11-10 03:26:17,456 INFO L226 Difference]: Without dead ends: 163 [2018-11-10 03:26:17,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=403, Invalid=2249, Unknown=0, NotChecked=0, Total=2652 [2018-11-10 03:26:17,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-10 03:26:17,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 136. [2018-11-10 03:26:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-10 03:26:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 157 transitions. [2018-11-10 03:26:17,467 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 157 transitions. Word has length 70 [2018-11-10 03:26:17,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:17,467 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 157 transitions. [2018-11-10 03:26:17,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 03:26:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 157 transitions. [2018-11-10 03:26:17,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 03:26:17,469 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:17,469 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:17,469 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:17,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:17,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1988142437, now seen corresponding path program 1 times [2018-11-10 03:26:17,470 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:26:17,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:26:17,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:17,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:26:17,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 03:26:17,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:26:17,513 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:17,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:17,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 03:26:17,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:26:17,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 03:26:17,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:26:17,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:26:17,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:26:17,584 INFO L87 Difference]: Start difference. First operand 136 states and 157 transitions. Second operand 5 states. [2018-11-10 03:26:17,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:17,600 INFO L93 Difference]: Finished difference Result 227 states and 268 transitions. [2018-11-10 03:26:17,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:26:17,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-11-10 03:26:17,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:17,601 INFO L225 Difference]: With dead ends: 227 [2018-11-10 03:26:17,601 INFO L226 Difference]: Without dead ends: 144 [2018-11-10 03:26:17,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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-10 03:26:17,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-10 03:26:17,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-11-10 03:26:17,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-10 03:26:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2018-11-10 03:26:17,613 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 72 [2018-11-10 03:26:17,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:17,614 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2018-11-10 03:26:17,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:26:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2018-11-10 03:26:17,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 03:26:17,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:17,617 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:17,617 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:17,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:17,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1922454349, now seen corresponding path program 1 times [2018-11-10 03:26:17,617 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:26:17,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:26:17,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:17,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:17,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 03:26:17,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:26:17,842 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:17,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:17,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:17,924 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-10 03:26:17,925 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-10 03:26:17,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:17,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:17,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:17,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 03:26:17,967 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-10 03:26:17,968 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-10 03:26:17,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:17,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:17,970 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-10 03:26:17,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 03:26:17,978 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 03:26:17,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:26:17,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2018-11-10 03:26:17,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-10 03:26:17,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 03:26:17,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-11-10 03:26:17,995 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand 21 states. [2018-11-10 03:26:18,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:18,389 INFO L93 Difference]: Finished difference Result 244 states and 289 transitions. [2018-11-10 03:26:18,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 03:26:18,390 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 80 [2018-11-10 03:26:18,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:18,391 INFO L225 Difference]: With dead ends: 244 [2018-11-10 03:26:18,391 INFO L226 Difference]: Without dead ends: 213 [2018-11-10 03:26:18,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2018-11-10 03:26:18,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-10 03:26:18,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 204. [2018-11-10 03:26:18,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-10 03:26:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 240 transitions. [2018-11-10 03:26:18,405 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 240 transitions. Word has length 80 [2018-11-10 03:26:18,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:18,406 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 240 transitions. [2018-11-10 03:26:18,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-10 03:26:18,406 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 240 transitions. [2018-11-10 03:26:18,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 03:26:18,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:18,407 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:18,407 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:18,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:18,408 INFO L82 PathProgramCache]: Analyzing trace with hash 991360165, now seen corresponding path program 1 times [2018-11-10 03:26:18,408 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:26:18,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:26:18,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:18,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:18,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 03:26:18,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:26:18,990 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:18,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:19,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:19,129 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-10 03:26:19,130 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-10 03:26:19,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:19,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:19,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:19,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 03:26:19,170 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-10 03:26:19,171 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-10 03:26:19,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:19,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:19,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:19,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-10 03:26:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 03:26:19,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:26:19,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 34 [2018-11-10 03:26:19,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-10 03:26:19,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-10 03:26:19,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1012, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 03:26:19,302 INFO L87 Difference]: Start difference. First operand 204 states and 240 transitions. Second operand 34 states. [2018-11-10 03:26:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:20,555 INFO L93 Difference]: Finished difference Result 278 states and 324 transitions. [2018-11-10 03:26:20,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 03:26:20,559 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 80 [2018-11-10 03:26:20,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:20,561 INFO L225 Difference]: With dead ends: 278 [2018-11-10 03:26:20,561 INFO L226 Difference]: Without dead ends: 161 [2018-11-10 03:26:20,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=477, Invalid=2829, Unknown=0, NotChecked=0, Total=3306 [2018-11-10 03:26:20,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-10 03:26:20,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2018-11-10 03:26:20,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-10 03:26:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2018-11-10 03:26:20,573 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 80 [2018-11-10 03:26:20,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:20,573 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2018-11-10 03:26:20,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-10 03:26:20,573 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2018-11-10 03:26:20,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 03:26:20,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:20,574 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:20,575 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:20,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:20,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2143548146, now seen corresponding path program 1 times [2018-11-10 03:26:20,575 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:26:20,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:26:20,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:20,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:20,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 03:26:21,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:26:21,112 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:21,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:21,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:21,226 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-10 03:26:21,228 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-10 03:26:21,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:21,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:21,235 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-10 03:26:21,236 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-10 03:26:21,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:21,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:21,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:21,241 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-10 03:26:21,280 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-10 03:26:21,281 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-10 03:26:21,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:21,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:21,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:21,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2018-11-10 03:26:21,346 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-10 03:26:21,348 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-10 03:26:21,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:21,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:21,355 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 16 [2018-11-10 03:26:21,357 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 16 treesize of output 7 [2018-11-10 03:26:21,357 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:21,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:21,362 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-10 03:26:21,363 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:10 [2018-11-10 03:26:21,401 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:26:21,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:26:21,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 36 [2018-11-10 03:26:21,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-10 03:26:21,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-10 03:26:21,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1127, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 03:26:21,431 INFO L87 Difference]: Start difference. First operand 153 states and 172 transitions. Second operand 36 states. [2018-11-10 03:26:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:22,377 INFO L93 Difference]: Finished difference Result 195 states and 220 transitions. [2018-11-10 03:26:22,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 03:26:22,378 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 81 [2018-11-10 03:26:22,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:22,378 INFO L225 Difference]: With dead ends: 195 [2018-11-10 03:26:22,379 INFO L226 Difference]: Without dead ends: 162 [2018-11-10 03:26:22,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=358, Invalid=2398, Unknown=0, NotChecked=0, Total=2756 [2018-11-10 03:26:22,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-10 03:26:22,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2018-11-10 03:26:22,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-10 03:26:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2018-11-10 03:26:22,387 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 81 [2018-11-10 03:26:22,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:22,388 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2018-11-10 03:26:22,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-10 03:26:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2018-11-10 03:26:22,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 03:26:22,388 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:22,389 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:22,389 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:22,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:22,389 INFO L82 PathProgramCache]: Analyzing trace with hash 51775190, now seen corresponding path program 1 times [2018-11-10 03:26:22,389 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:26:22,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:26:22,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:22,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:22,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:22,987 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 03:26:22,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:26:22,987 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:22,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:23,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:23,062 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-10 03:26:23,063 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-10 03:26:23,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:23,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:23,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:23,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-10 03:26:23,150 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-10 03:26:23,152 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-10 03:26:23,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:23,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:23,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:23,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-10 03:26:23,249 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 25 treesize of output 20 [2018-11-10 03:26:23,251 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:26:23,253 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 20 treesize of output 31 [2018-11-10 03:26:23,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:23,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:23,266 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-10 03:26:23,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:16 [2018-11-10 03:26:23,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 9 treesize of output 7 [2018-11-10 03:26:23,272 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-10 03:26:23,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:23,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:23,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:23,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-10 03:26:23,405 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-10 03:26:23,407 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-10 03:26:23,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:23,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:23,412 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-10 03:26:23,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-10 03:26:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 31 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 03:26:23,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:26:23,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 44 [2018-11-10 03:26:23,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-10 03:26:23,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-10 03:26:23,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1634, Unknown=22, NotChecked=0, Total=1892 [2018-11-10 03:26:23,464 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand 44 states. [2018-11-10 03:26:25,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:25,875 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2018-11-10 03:26:25,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-10 03:26:25,875 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 85 [2018-11-10 03:26:25,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:25,876 INFO L225 Difference]: With dead ends: 207 [2018-11-10 03:26:25,877 INFO L226 Difference]: Without dead ends: 184 [2018-11-10 03:26:25,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=761, Invalid=4310, Unknown=41, NotChecked=0, Total=5112 [2018-11-10 03:26:25,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-10 03:26:25,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 155. [2018-11-10 03:26:25,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-10 03:26:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 170 transitions. [2018-11-10 03:26:25,897 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 170 transitions. Word has length 85 [2018-11-10 03:26:25,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:25,897 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 170 transitions. [2018-11-10 03:26:25,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-10 03:26:25,897 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2018-11-10 03:26:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 03:26:25,898 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:25,898 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:25,898 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:25,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:25,898 INFO L82 PathProgramCache]: Analyzing trace with hash -845747798, now seen corresponding path program 1 times [2018-11-10 03:26:25,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:26:25,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:26:25,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:25,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:25,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 03:26:25,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:26:25,921 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:25,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:25,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 03:26:26,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:26:26,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-11-10 03:26:26,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:26:26,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:26:26,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:26:26,044 INFO L87 Difference]: Start difference. First operand 155 states and 170 transitions. Second operand 6 states. [2018-11-10 03:26:26,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:26,064 INFO L93 Difference]: Finished difference Result 243 states and 275 transitions. [2018-11-10 03:26:26,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:26:26,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-11-10 03:26:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:26,066 INFO L225 Difference]: With dead ends: 243 [2018-11-10 03:26:26,066 INFO L226 Difference]: Without dead ends: 167 [2018-11-10 03:26:26,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 89 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-10 03:26:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-10 03:26:26,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-11-10 03:26:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-10 03:26:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 180 transitions. [2018-11-10 03:26:26,075 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 180 transitions. Word has length 89 [2018-11-10 03:26:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:26,075 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 180 transitions. [2018-11-10 03:26:26,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:26:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2018-11-10 03:26:26,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 03:26:26,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:26,076 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:26,076 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:26,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:26,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1517668531, now seen corresponding path program 1 times [2018-11-10 03:26:26,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:26:26,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:26:26,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:26,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:26,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:26,250 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 03:26:26,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:26:26,250 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:26,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:26,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:26,451 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-10 03:26:26,453 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-10 03:26:26,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:26,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:26,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:26,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 03:26:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 03:26:26,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:26:26,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 33 [2018-11-10 03:26:26,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-10 03:26:26,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-10 03:26:26,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 03:26:26,634 INFO L87 Difference]: Start difference. First operand 166 states and 180 transitions. Second operand 33 states. [2018-11-10 03:26:29,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:29,149 INFO L93 Difference]: Finished difference Result 357 states and 382 transitions. [2018-11-10 03:26:29,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-10 03:26:29,150 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 95 [2018-11-10 03:26:29,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:29,150 INFO L225 Difference]: With dead ends: 357 [2018-11-10 03:26:29,151 INFO L226 Difference]: Without dead ends: 249 [2018-11-10 03:26:29,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1237, Invalid=7505, Unknown=0, NotChecked=0, Total=8742 [2018-11-10 03:26:29,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-10 03:26:29,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 210. [2018-11-10 03:26:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-10 03:26:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 224 transitions. [2018-11-10 03:26:29,164 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 224 transitions. Word has length 95 [2018-11-10 03:26:29,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:29,164 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 224 transitions. [2018-11-10 03:26:29,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-10 03:26:29,164 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 224 transitions. [2018-11-10 03:26:29,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 03:26:29,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:29,165 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:29,165 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:29,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:29,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1561738813, now seen corresponding path program 2 times [2018-11-10 03:26:29,165 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:26:29,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:26:29,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:29,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:29,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 03:26:29,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:26:29,496 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:26:29,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:26:29,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:26:29,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:26:29,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:29,670 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-10 03:26:29,671 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-10 03:26:29,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:29,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:29,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:29,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-10 03:26:29,711 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-10 03:26:29,713 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-10 03:26:29,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:29,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:29,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:29,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-10 03:26:29,822 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-10 03:26:29,824 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:26:29,825 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 18 treesize of output 27 [2018-11-10 03:26:29,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:29,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:29,837 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-10 03:26:29,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:17 [2018-11-10 03:26:29,955 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-10 03:26:29,956 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-10 03:26:29,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:29,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:29,958 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-10 03:26:29,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-10 03:26:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 03:26:30,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:26:30,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 44 [2018-11-10 03:26:30,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-10 03:26:30,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-10 03:26:30,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1715, Unknown=22, NotChecked=0, Total=1892 [2018-11-10 03:26:30,003 INFO L87 Difference]: Start difference. First operand 210 states and 224 transitions. Second operand 44 states. [2018-11-10 03:26:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:31,080 INFO L93 Difference]: Finished difference Result 241 states and 251 transitions. [2018-11-10 03:26:31,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 03:26:31,081 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 95 [2018-11-10 03:26:31,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:31,082 INFO L225 Difference]: With dead ends: 241 [2018-11-10 03:26:31,082 INFO L226 Difference]: Without dead ends: 163 [2018-11-10 03:26:31,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=354, Invalid=3274, Unknown=32, NotChecked=0, Total=3660 [2018-11-10 03:26:31,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-10 03:26:31,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 129. [2018-11-10 03:26:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-10 03:26:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2018-11-10 03:26:31,091 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 95 [2018-11-10 03:26:31,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:31,091 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2018-11-10 03:26:31,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-10 03:26:31,091 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2018-11-10 03:26:31,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 03:26:31,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:31,092 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:31,092 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:31,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:31,092 INFO L82 PathProgramCache]: Analyzing trace with hash 16069683, now seen corresponding path program 1 times [2018-11-10 03:26:31,092 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:26:31,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:26:31,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:31,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:26:31,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 03:26:31,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:26:31,351 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:26:31,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:31,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:31,429 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-10 03:26:31,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 10 treesize of output 9 [2018-11-10 03:26:31,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:31,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:31,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:31,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-10 03:26:31,590 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-10 03:26:31,591 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-10 03:26:31,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:31,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:31,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:31,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-10 03:26:31,658 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 25 treesize of output 20 [2018-11-10 03:26:31,660 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:26:31,661 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 20 treesize of output 31 [2018-11-10 03:26:31,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:31,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:31,670 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-10 03:26:31,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:16 [2018-11-10 03:26:31,672 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-10 03:26:31,673 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-10 03:26:31,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:31,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:31,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:31,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-10 03:26:31,800 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-10 03:26:31,801 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-10 03:26:31,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:31,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:31,803 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-10 03:26:31,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-10 03:26:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 27 proven. 32 refuted. 2 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 03:26:31,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:26:31,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 41 [2018-11-10 03:26:31,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-10 03:26:31,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-10 03:26:31,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1462, Unknown=15, NotChecked=0, Total=1640 [2018-11-10 03:26:31,852 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand 41 states. [2018-11-10 03:26:33,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:33,231 INFO L93 Difference]: Finished difference Result 163 states and 169 transitions. [2018-11-10 03:26:33,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-10 03:26:33,231 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 101 [2018-11-10 03:26:33,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:33,232 INFO L225 Difference]: With dead ends: 163 [2018-11-10 03:26:33,232 INFO L226 Difference]: Without dead ends: 125 [2018-11-10 03:26:33,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=562, Invalid=4369, Unknown=39, NotChecked=0, Total=4970 [2018-11-10 03:26:33,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-10 03:26:33,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 110. [2018-11-10 03:26:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-10 03:26:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-11-10 03:26:33,247 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 101 [2018-11-10 03:26:33,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:33,247 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-11-10 03:26:33,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-10 03:26:33,247 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-11-10 03:26:33,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 03:26:33,248 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:33,248 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:33,248 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:33,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:33,248 INFO L82 PathProgramCache]: Analyzing trace with hash 406181917, now seen corresponding path program 3 times [2018-11-10 03:26:33,249 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:26:33,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:26:33,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:33,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:33,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:26:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 47 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 03:26:33,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:26:33,301 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:26:33,307 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 03:26:33,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 03:26:33,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:26:33,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:33,356 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 03:26:33,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:26:33,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-11-10 03:26:33,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:26:33,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:26:33,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:26:33,372 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 6 states. [2018-11-10 03:26:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:33,385 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-11-10 03:26:33,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:26:33,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-11-10 03:26:33,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:33,385 INFO L225 Difference]: With dead ends: 113 [2018-11-10 03:26:33,385 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 03:26:33,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 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-10 03:26:33,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 03:26:33,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 03:26:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 03:26:33,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 03:26:33,386 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2018-11-10 03:26:33,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:33,386 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:26:33,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:26:33,386 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:26:33,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 03:26:33,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 03:26:33,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:26:33,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:26:33,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:26:33,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:26:33,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:26:33,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:26:33,761 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2018-11-10 03:26:34,416 WARN L179 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 106 [2018-11-10 03:26:34,523 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2018-11-10 03:26:34,729 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 52 [2018-11-10 03:26:34,935 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2018-11-10 03:26:35,308 INFO L425 ceAbstractionStarter]: For program point L19(lines 17 20) no Hoare annotation was computed. [2018-11-10 03:26:35,308 INFO L421 ceAbstractionStarter]: At program point initENTRY(lines 15 21) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= 0 (select .cse0 (+ |~#pp~0.offset| 4)))) (not (= 0 |~#pstate~0.offset|)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 0 |~#pp~0.offset|)) (not (= ~counter~0 1)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) 0) 0)) (not (= (select .cse0 0) 0)))) [2018-11-10 03:26:35,308 INFO L425 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-10 03:26:35,308 INFO L425 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2018-11-10 03:26:35,308 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 17 20) no Hoare annotation was computed. [2018-11-10 03:26:35,308 INFO L421 ceAbstractionStarter]: At program point L17-3(lines 17 20) the Hoare annotation is: (let ((.cse1 (+ |~#pp~0.offset| 4)) (.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= 0 (select .cse0 .cse1))) (not (= 0 |~#pstate~0.offset|)) (and (<= init_~i~0 (+ (div (+ .cse1 (- |~#pp~0.offset|)) 4) 1)) (let ((.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 (select .cse2 0)) (= 0 (select .cse2 .cse1)) (= 0 (select (select |#memory_$Pointer$.base| |~#pp~0.base|) 0))))) (not (= 0 |~#pp~0.offset|)) (not (= ~counter~0 1)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) 0) 0)) (not (= (select .cse0 0) 0)))) [2018-11-10 03:26:35,308 INFO L425 ceAbstractionStarter]: For program point L17-4(lines 15 21) no Hoare annotation was computed. [2018-11-10 03:26:35,308 INFO L425 ceAbstractionStarter]: For program point initEXIT(lines 15 21) no Hoare annotation was computed. [2018-11-10 03:26:35,308 INFO L425 ceAbstractionStarter]: For program point mallocFINAL(lines 46 49) no Hoare annotation was computed. [2018-11-10 03:26:35,308 INFO L425 ceAbstractionStarter]: For program point mallocEXIT(lines 46 49) no Hoare annotation was computed. [2018-11-10 03:26:35,309 INFO L421 ceAbstractionStarter]: At program point mallocENTRY(lines 46 49) the Hoare annotation is: (let ((.cse0 (or (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (or (not (= 0 (select .cse1 (+ |~#pp~0.offset| 4)))) (or (not (= 0 |~#pstate~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) 0) 0)) (not (= (select .cse1 0) 0))))) (not (= 0 |~#pp~0.offset|))))) (and (or (= ~counter~0 |old(~counter~0)|) .cse0 (not (= |old(~counter~0)| 2))) (or (= ~counter~0 1) .cse0 (not (= |old(~counter~0)| 1))))) [2018-11-10 03:26:35,309 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 03:26:35,309 INFO L425 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-11-10 03:26:35,309 INFO L425 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2018-11-10 03:26:35,309 INFO L425 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2018-11-10 03:26:35,309 INFO L425 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. [2018-11-10 03:26:35,309 INFO L425 ceAbstractionStarter]: For program point L13-2(line 13) no Hoare annotation was computed. [2018-11-10 03:26:35,309 INFO L425 ceAbstractionStarter]: For program point L12-2(line 12) no Hoare annotation was computed. [2018-11-10 03:26:35,309 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~counter~0)| ~counter~0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-10 03:26:35,309 INFO L425 ceAbstractionStarter]: For program point L12-3(line 12) no Hoare annotation was computed. [2018-11-10 03:26:35,309 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:26:35,309 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-10 03:26:35,309 INFO L425 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-11-10 03:26:35,309 INFO L425 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2018-11-10 03:26:35,309 INFO L425 ceAbstractionStarter]: For program point L26-1(lines 26 30) no Hoare annotation was computed. [2018-11-10 03:26:35,309 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 25 31) no Hoare annotation was computed. [2018-11-10 03:26:35,309 INFO L425 ceAbstractionStarter]: For program point L25-3(lines 25 31) no Hoare annotation was computed. [2018-11-10 03:26:35,309 INFO L421 ceAbstractionStarter]: At program point L25-4(lines 25 31) the Hoare annotation is: (let ((.cse8 (= |f_#in~pointer.offset| f_~pointer.offset)) (.cse5 (= |#memory_int| |old(#memory_int)|)) (.cse6 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse7 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse4 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse0 (not (= 0 (select .cse4 (+ |~#pp~0.offset| 4))))) (.cse3 (and (= f_~pointer.base |f_#in~pointer.base|) .cse8 .cse5 (= f_~i~1 0) .cse6 .cse7)) (.cse1 (not (= 0 |~#pstate~0.offset|))) (.cse2 (not (= 0 |~#pp~0.offset|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) 0) 0)) (not (= (select .cse4 0) 0))) (or .cse0 .cse3 .cse1 (and (<= 2 f_~i~1) .cse5 .cse6 .cse7) (not (= 1 (select .cse4 |~#pp~0.offset|))) .cse2 (and .cse8 (<= 1 f_~i~1) .cse5 .cse6 .cse7) (not (= 1 (select (select |old(#memory_int)| |~#pstate~0.base|) 0))))))) [2018-11-10 03:26:35,309 INFO L425 ceAbstractionStarter]: For program point L25-5(lines 23 32) no Hoare annotation was computed. [2018-11-10 03:26:35,309 INFO L425 ceAbstractionStarter]: For program point fEXIT(lines 23 32) no Hoare annotation was computed. [2018-11-10 03:26:35,310 INFO L421 ceAbstractionStarter]: At program point fENTRY(lines 23 32) the Hoare annotation is: (let ((.cse2 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse0 (not (= 0 (select .cse2 (+ |~#pp~0.offset| 4))))) (.cse1 (not (= 0 |~#pstate~0.offset|))) (.cse3 (not (= 0 |~#pp~0.offset|))) (.cse4 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))) (and (or .cse0 .cse1 (not (= 1 (select .cse2 |~#pp~0.offset|))) .cse3 (not (= 1 (select (select |old(#memory_int)| |~#pstate~0.base|) 0))) .cse4) (or .cse0 .cse1 .cse3 (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) 0) 0)) (not (= (select .cse2 0) 0)) .cse4)))) [2018-11-10 03:26:35,310 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-10 03:26:35,310 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 36 42) no Hoare annotation was computed. [2018-11-10 03:26:35,310 INFO L425 ceAbstractionStarter]: For program point L36-3(lines 36 42) no Hoare annotation was computed. [2018-11-10 03:26:35,310 INFO L421 ceAbstractionStarter]: At program point L36-4(lines 36 42) the Hoare annotation is: (let ((.cse14 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse26 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse27 (select |#memory_int| |~#pstate~0.base|)) (.cse28 (+ |~#pp~0.offset| 4))) (let ((.cse18 (<= 1 g_~i~2)) (.cse24 (= 1 (select .cse27 .cse28))) (.cse29 (= |~#pstate~0.offset| 0)) (.cse16 (<= 2 g_~i~2)) (.cse30 (@diff .cse26 .cse27)) (.cse17 (select .cse14 |~#pp~0.offset|)) (.cse22 (= 2 g_~pointer.offset)) (.cse11 (= |#memory_int| |old(#memory_int)|)) (.cse9 (= g_~i~2 0)) (.cse23 (select .cse14 .cse28))) (let ((.cse13 (not (= 0 .cse23))) (.cse5 (and .cse22 .cse11 .cse9)) (.cse7 (not (= |g_#in~pointer.offset| 2))) (.cse4 (not (= 1 .cse17))) (.cse12 (not (= 1 (select .cse26 0)))) (.cse19 (or (let ((.cse31 (+ |~#pstate~0.offset| (- .cse30)))) (and (<= (+ g_~i~2 (div .cse31 4)) 1) (= (mod .cse31 4) 0))) (= .cse27 .cse26))) (.cse20 (= .cse27 (store .cse26 .cse30 (select .cse27 .cse30)))) (.cse0 (and .cse29 .cse16)) (.cse1 (not (= 0 |~#pstate~0.offset|))) (.cse3 (and .cse29 .cse18 .cse24 (<= g_~i~2 1))) (.cse2 (not (= 1 (select .cse26 .cse28)))) (.cse6 (not (= 0 |~#pp~0.offset|)))) (and (or .cse0 (or .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse21 (select |#memory_$Pointer$.base| |~#pp~0.base|))) (let ((.cse8 (select .cse21 |~#pp~0.offset|)) (.cse10 (= 1 g_~pointer.offset)) (.cse15 (= g_~pointer.base (select .cse21 0)))) (or (and (= .cse8 g_~pointer.base) .cse9 .cse10 .cse11) .cse6 .cse12 (not (= |g_#in~pointer.base| .cse8)) .cse13 .cse1 (not (= |g_#in~pointer.offset| 1)) (and (= g_~pointer.offset (select .cse14 0)) .cse15 .cse16) (not (= |g_#in~pointer.offset| .cse17)) (and .cse18 .cse19 .cse10 .cse20 .cse15)))) (or .cse0 .cse13 .cse5 (and .cse22 (and .cse20 .cse18 .cse19)) (or .cse1 .cse4 .cse6) .cse7) (let ((.cse25 (= |g_#in~pointer.offset| g_~pointer.offset))) (or .cse2 (not (= 2 .cse23)) .cse4 (and .cse24 .cse16) .cse6 .cse12 (and .cse25 .cse11) (and .cse16 (= |g_#in~pointer.offset| .cse23)) (and .cse18 .cse19 .cse25 .cse20 .cse24) .cse1)) (or .cse0 (not (= 1 (select .cse26 |~#pstate~0.offset|))) .cse1 .cse3 .cse2 .cse6 (and (= (select .cse27 |~#pstate~0.offset|) 1) .cse24 .cse9)))))) [2018-11-10 03:26:35,310 INFO L425 ceAbstractionStarter]: For program point L36-5(lines 34 43) no Hoare annotation was computed. [2018-11-10 03:26:35,310 INFO L425 ceAbstractionStarter]: For program point gEXIT(lines 34 43) no Hoare annotation was computed. [2018-11-10 03:26:35,310 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-10 03:26:35,310 INFO L425 ceAbstractionStarter]: For program point L39-1(line 39) no Hoare annotation was computed. [2018-11-10 03:26:35,310 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-10 03:26:35,310 INFO L421 ceAbstractionStarter]: At program point gENTRY(lines 34 43) the Hoare annotation is: (let ((.cse9 (+ |~#pp~0.offset| 4)) (.cse13 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse11 (select .cse13 |~#pp~0.offset|)) (.cse6 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse12 (select .cse13 .cse9))) (let ((.cse0 (not (= 0 .cse12))) (.cse5 (not (= |g_#in~pointer.offset| 2))) (.cse2 (not (= 0 |~#pstate~0.offset|))) (.cse7 (not (= 1 (select .cse6 .cse9)))) (.cse3 (not (= 1 .cse11))) (.cse4 (not (= 0 |~#pp~0.offset|))) (.cse1 (= |#memory_int| |old(#memory_int)|)) (.cse10 (not (= 1 (select .cse6 0))))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4) .cse5) (or (not (= 1 (select .cse6 |~#pstate~0.offset|))) .cse2 .cse7 .cse4 (let ((.cse8 (select |#memory_int| |~#pstate~0.base|))) (and (= (select .cse8 |~#pstate~0.offset|) 1) (= 1 (select .cse8 .cse9))))) (or .cse0 .cse2 .cse4 .cse1 .cse10 (not (= |g_#in~pointer.offset| 1)) (not (= |g_#in~pointer.offset| .cse11)) (not (= |g_#in~pointer.base| (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|)))) (or (or .cse2 .cse7) .cse1 .cse3 .cse4 .cse5) (or .cse2 .cse7 (not (= 2 .cse12)) .cse3 .cse4 .cse1 .cse10))))) [2018-11-10 03:26:35,310 INFO L425 ceAbstractionStarter]: For program point L37-1(lines 37 41) no Hoare annotation was computed. [2018-11-10 03:26:35,310 INFO L421 ceAbstractionStarter]: At program point L39-3(line 39) the Hoare annotation is: (let ((.cse9 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse3 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse4 (select .cse9 |~#pp~0.offset|)) (.cse8 (+ |~#pp~0.offset| 4))) (let ((.cse0 (not (= 0 (select .cse9 .cse8)))) (.cse5 (not (= 1 .cse4))) (.cse6 (not (= |g_#in~pointer.offset| 2))) (.cse1 (not (= 0 |~#pstate~0.offset|))) (.cse7 (not (= 1 (select .cse3 .cse8)))) (.cse2 (not (= 0 |~#pp~0.offset|)))) (and (or .cse0 .cse1 .cse2 (not (= 1 (select .cse3 0))) (not (= |g_#in~pointer.offset| 1)) (not (= |g_#in~pointer.offset| .cse4)) (not (= |g_#in~pointer.base| (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|)))) (or .cse0 (or .cse1 .cse5 .cse2) .cse6) (or (or .cse1 .cse7) .cse5 .cse2 .cse6) (or (not (= 1 (select .cse3 |~#pstate~0.offset|))) .cse1 .cse7 .cse2))))) [2018-11-10 03:26:35,310 INFO L425 ceAbstractionStarter]: For program point L39-4(line 39) no Hoare annotation was computed. [2018-11-10 03:26:35,311 INFO L425 ceAbstractionStarter]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2018-11-10 03:26:35,311 INFO L425 ceAbstractionStarter]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-10 03:26:35,311 INFO L425 ceAbstractionStarter]: For program point __blast_assertFINAL(lines 4 7) no Hoare annotation was computed. [2018-11-10 03:26:35,311 INFO L428 ceAbstractionStarter]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2018-11-10 03:26:35,311 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:26:35,311 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= |~#pstate~0.offset| 0) (= 0 (select .cse0 0)) (= 0 (select .cse0 (+ |~#pp~0.offset| 4))) (= 0 (select (select |#memory_$Pointer$.base| |~#pp~0.base|) 0)) (= ~counter~0 1) (= 0 |~#pp~0.offset|))) [2018-11-10 03:26:35,311 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 03:26:35,311 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 03:26:35,311 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-10 03:26:35,311 INFO L421 ceAbstractionStarter]: At program point L62(line 62) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse8 (select |#memory_int| |~#pstate~0.base|)) (.cse1 (+ |~#pp~0.offset| 4))) (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse3 (= main_~a~0.base 0)) (.cse9 (= 1 (select .cse8 .cse1))) (.cse5 (= main_~b~0.offset 2)) (.cse4 (= 1 main_~a~0.offset)) (.cse6 (not (= ~counter~0 1))) (.cse7 (= 1 (select .cse2 |~#pp~0.offset|)))) (or (not (= 0 (select .cse0 .cse1))) (not (= 0 |~#pstate~0.offset|)) (and (= 0 main_~b~0.base) (= 0 (select .cse2 .cse1)) .cse3 .cse4 .cse5 .cse6 .cse7) (not (= 0 |~#pp~0.offset|)) (and .cse3 (= (select .cse8 |~#pstate~0.offset|) 1) .cse9 (= main_~a~0.offset 1)) (not (= |old(~counter~0)| 1)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) 0) 0)) (not (= (select .cse0 0) 0)) (and .cse3 .cse9 .cse5 .cse4 .cse6 .cse7)))) [2018-11-10 03:26:35,311 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 51 69) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= 0 (select .cse0 (+ |~#pp~0.offset| 4)))) (not (= 0 |~#pstate~0.offset|)) (and (= |#memory_int| |old(#memory_int)|) (= ~counter~0 1) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 0 |~#pp~0.offset|)) (not (= |old(~counter~0)| 1)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) 0) 0)) (not (= (select .cse0 0) 0)))) [2018-11-10 03:26:35,311 INFO L421 ceAbstractionStarter]: At program point L61(line 61) the Hoare annotation is: (let ((.cse9 (select |#memory_int| |~#pstate~0.base|)) (.cse10 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse1 (+ |~#pp~0.offset| 4))) (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse2 (select .cse10 .cse1)) (.cse3 (= main_~a~0.base 0)) (.cse4 (= (select .cse9 |~#pstate~0.offset|) 1)) (.cse5 (= main_~b~0.offset 2)) (.cse6 (= 1 main_~a~0.offset)) (.cse7 (not (= ~counter~0 1))) (.cse8 (= 1 (select .cse10 |~#pp~0.offset|)))) (or (not (= 0 (select .cse0 .cse1))) (not (= 0 |~#pstate~0.offset|)) (not (= 0 |~#pp~0.offset|)) (and (= 0 main_~b~0.base) (= 0 .cse2) (= 0 (select (select |#memory_$Pointer$.base| |~#pp~0.base|) 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= |old(~counter~0)| 1)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) 0) 0)) (not (= (select .cse0 0) 0)) (and (= 2 .cse2) .cse3 .cse4 (= 1 (select .cse9 .cse1)) .cse5 .cse6 .cse7 .cse8)))) [2018-11-10 03:26:35,311 INFO L421 ceAbstractionStarter]: At program point L60(line 60) the Hoare annotation is: (let ((.cse1 (+ |~#pp~0.offset| 4)) (.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= 0 (select .cse0 .cse1))) (not (= 0 |~#pstate~0.offset|)) (not (= 0 |~#pp~0.offset|)) (let ((.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (and (= 0 (select .cse2 0)) (= 0 (select (select |#memory_$Pointer$.base| |~#pp~0.base|) 0)) (= main_~a~0.base 0)) (= 0 main_~b~0.base) (= 0 (select .cse2 .cse1)) (= main_~b~0.offset 2) (= 1 main_~a~0.offset) (not (= ~counter~0 1)))) (not (= |old(~counter~0)| 1)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) 0) 0)) (not (= (select .cse0 0) 0)))) [2018-11-10 03:26:35,311 INFO L421 ceAbstractionStarter]: At program point L60-1(line 60) the Hoare annotation is: (let ((.cse1 (+ |~#pp~0.offset| 4)) (.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= 0 (select .cse0 .cse1))) (not (= 0 |~#pstate~0.offset|)) (not (= 0 |~#pp~0.offset|)) (let ((.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 main_~b~0.base) (= 0 (select .cse2 .cse1)) (= 0 (select (select |#memory_$Pointer$.base| |~#pp~0.base|) 0)) (= main_~a~0.base 0) (= (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|) 1) (= main_~b~0.offset 2) (= 1 main_~a~0.offset) (not (= ~counter~0 1)) (= 1 (select .cse2 |~#pp~0.offset|)))) (not (= |old(~counter~0)| 1)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) 0) 0)) (not (= (select .cse0 0) 0)))) [2018-11-10 03:26:35,312 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 58) no Hoare annotation was computed. [2018-11-10 03:26:35,312 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 51 69) no Hoare annotation was computed. [2018-11-10 03:26:35,312 INFO L421 ceAbstractionStarter]: At program point L56(line 56) the Hoare annotation is: (let ((.cse1 (+ |~#pp~0.offset| 4)) (.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= 0 (select .cse0 .cse1))) (not (= 0 |~#pstate~0.offset|)) (and (let ((.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 (select .cse2 0)) (= 0 (select .cse2 .cse1)) (= 0 (select (select |#memory_$Pointer$.base| |~#pp~0.base|) 0)) (= main_~a~0.base 0))) (= main_~a~0.offset 1) (= ~counter~0 (+ |old(~counter~0)| 1))) (not (= 0 |~#pp~0.offset|)) (not (= |old(~counter~0)| 1)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) 0) 0)) (not (= (select .cse0 0) 0)))) [2018-11-10 03:26:35,312 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-10 03:26:35,312 INFO L425 ceAbstractionStarter]: For program point L56-1(line 56) no Hoare annotation was computed. [2018-11-10 03:26:35,312 INFO L421 ceAbstractionStarter]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= 0 (select .cse0 (+ |~#pp~0.offset| 4)))) (not (= 0 |~#pstate~0.offset|)) (and (= |#memory_int| |old(#memory_int)|) (= ~counter~0 1) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 0 |~#pp~0.offset|)) (not (= |old(~counter~0)| 1)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) 0) 0)) (not (= (select .cse0 0) 0)))) [2018-11-10 03:26:35,312 INFO L421 ceAbstractionStarter]: At program point L54-1(line 54) the Hoare annotation is: (let ((.cse1 (+ |~#pp~0.offset| 4)) (.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= 0 (select .cse0 .cse1))) (not (= 0 |~#pstate~0.offset|)) (not (= 0 |~#pp~0.offset|)) (let ((.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 (select .cse2 0)) (= 0 (select .cse2 .cse1)) (= 0 (select (select |#memory_$Pointer$.base| |~#pp~0.base|) 0)) (= ~counter~0 1))) (not (= |old(~counter~0)| 1)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) 0) 0)) (not (= (select .cse0 0) 0)))) [2018-11-10 03:26:35,312 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 51 69) no Hoare annotation was computed. [2018-11-10 03:26:35,318 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,319 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,319 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,320 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,320 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,320 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,320 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,320 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,321 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,321 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,321 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,321 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,321 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,321 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,322 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,322 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,322 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,322 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,322 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,323 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,323 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,324 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,324 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,324 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,324 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,324 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,325 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,325 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,325 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,325 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,325 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,325 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,325 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,325 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,325 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,325 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,325 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,326 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,326 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,326 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,326 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,326 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,326 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,326 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,326 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,326 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,326 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,326 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,327 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,327 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,327 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,329 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,329 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,329 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,329 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,329 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,329 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,329 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,329 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,330 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,330 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,330 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,330 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,330 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,330 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,331 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,331 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,331 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,331 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,331 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,331 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,332 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,333 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,333 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,333 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,333 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,333 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,333 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,334 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,334 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,334 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,334 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,334 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,334 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,334 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,334 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,334 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,335 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,335 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,335 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,335 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,335 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,335 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,335 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,335 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,335 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,335 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,338 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:551) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:246) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:373) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:108) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:92) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:537) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) 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-10 03:26:35,341 INFO L168 Benchmark]: Toolchain (without parser) took 20759.15 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 501.7 MB). Free memory was 959.1 MB in the beginning and 1.3 GB in the end (delta: -366.9 MB). Peak memory consumption was 634.3 MB. Max. memory is 11.5 GB. [2018-11-10 03:26:35,342 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:26:35,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.92 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:26:35,342 INFO L168 Benchmark]: Boogie Preprocessor took 27.00 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:26:35,342 INFO L168 Benchmark]: RCFGBuilder took 329.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:26:35,343 INFO L168 Benchmark]: TraceAbstraction took 20248.19 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 370.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -221.8 MB). Peak memory consumption was 647.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:26:35,348 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.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.92 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.00 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 329.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20248.19 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 370.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -221.8 MB). Peak memory consumption was 647.7 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$.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$.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$.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$.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$.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$.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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_$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_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_$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_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_int * 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-10 03:26:35,353 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,353 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,353 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,354 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,354 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,354 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,354 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,354 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,354 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,355 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,355 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,355 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,355 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,355 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,355 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,355 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,356 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,356 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,356 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,356 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,356 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,360 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,360 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,360 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,360 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,361 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,361 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,361 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,361 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,361 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,361 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,362 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,362 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,362 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,362 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,362 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,362 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,362 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,363 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,363 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,363 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,363 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,363 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:26:35,363 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,363 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:26:35,364 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,364 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,364 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,364 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,364 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,364 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,364 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,365 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,365 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,365 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,365 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,365 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,365 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,366 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,366 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,366 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,366 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,366 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,366 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,366 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,366 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,366 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,366 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,366 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:26:35,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:26:35,367 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((!(0 == \old(#memory_$Pointer$)[pp][pp + 4]) || !(0 == pstate)) || !(0 == pp)) || (((((pointer == pointer && pointer == pointer) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(\old(#memory_$Pointer$)[pp][0] == 0)) || !(\old(#memory_$Pointer$)[pp][0] == 0)) && (((((((!(0 == \old(#memory_$Pointer$)[pp][pp + 4]) || (((((pointer == pointer && pointer == pointer) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(0 == pstate)) || (((2 <= i && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(1 == \old(#memory_$Pointer$)[pp][pp])) || !(0 == pp)) || ((((pointer == pointer && 1 <= i) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(1 == \old(unknown-#memory_int-unknown)[pstate][0])) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:551) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:26:36,777 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:26:36,778 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:26:36,787 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:26:36,787 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:26:36,787 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:26:36,788 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:26:36,789 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:26:36,790 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:26:36,791 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:26:36,792 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:26:36,792 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:26:36,793 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:26:36,793 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:26:36,794 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:26:36,795 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:26:36,796 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:26:36,797 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:26:36,798 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:26:36,799 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:26:36,800 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:26:36,801 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:26:36,802 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:26:36,803 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:26:36,803 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:26:36,804 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:26:36,805 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:26:36,805 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:26:36,806 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:26:36,806 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:26:36,807 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:26:36,807 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:26:36,808 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:26:36,808 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:26:36,809 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:26:36,809 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:26:36,809 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-10 03:26:36,819 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:26:36,819 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:26:36,820 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:26:36,820 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 03:26:36,820 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:26:36,821 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:26:36,821 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:26:36,821 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:26:36,821 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:26:36,821 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:26:36,821 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:26:36,821 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:26:36,821 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:26:36,822 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:26:36,822 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 03:26:36,822 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 03:26:36,822 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:26:36,822 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:26:36,822 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:26:36,822 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:26:36,822 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:26:36,823 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:26:36,823 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:26:36,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:26:36,823 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:26:36,825 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:26:36,825 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:26:36,825 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-10 03:26:36,825 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:26:36,826 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 03:26:36,826 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 03:26:36,826 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_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:36,856 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:26:36,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:26:36,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:26:36,868 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:26:36,869 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:26:36,869 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-10 03:26:36,909 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/data/d8b991c76/03f72ef406244404b38ecd90ddd18ee5/FLAG10c599631 [2018-11-10 03:26:37,297 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:26:37,298 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-10 03:26:37,301 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/data/d8b991c76/03f72ef406244404b38ecd90ddd18ee5/FLAG10c599631 [2018-11-10 03:26:37,311 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/data/d8b991c76/03f72ef406244404b38ecd90ddd18ee5 [2018-11-10 03:26:37,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:26:37,314 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 03:26:37,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:26:37,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:26:37,317 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:26:37,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:26:37" (1/1) ... [2018-11-10 03:26:37,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7170a52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:37, skipping insertion in model container [2018-11-10 03:26:37,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:26:37" (1/1) ... [2018-11-10 03:26:37,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:26:37,338 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:26:37,462 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:26:37,467 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:26:37,485 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:26:37,506 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:26:37,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:37 WrapperNode [2018-11-10 03:26:37,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:26:37,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:26:37,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:26:37,508 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:26:37,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:37" (1/1) ... [2018-11-10 03:26:37,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:37" (1/1) ... [2018-11-10 03:26:37,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:37" (1/1) ... [2018-11-10 03:26:37,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:37" (1/1) ... [2018-11-10 03:26:37,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:37" (1/1) ... [2018-11-10 03:26:37,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:37" (1/1) ... [2018-11-10 03:26:37,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:37" (1/1) ... [2018-11-10 03:26:37,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:26:37,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:26:37,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:26:37,536 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:26:37,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:37,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:26:37,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:26:37,623 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-10 03:26:37,623 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-10 03:26:37,623 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-10 03:26:37,623 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-10 03:26:37,623 INFO L138 BoogieDeclarations]: Found implementation of procedure malloc [2018-11-10 03:26:37,624 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:26:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 03:26:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-10 03:26:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-10 03:26:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 03:26:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-10 03:26:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-10 03:26:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 03:26:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-10 03:26:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-10 03:26:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 03:26:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:26:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:26:37,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 03:26:37,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-10 03:26:37,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:26:37,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 03:26:37,852 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:26:37,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:26:37 BoogieIcfgContainer [2018-11-10 03:26:37,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:26:37,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:26:37,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:26:37,855 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:26:37,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:26:37" (1/3) ... [2018-11-10 03:26:37,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2e6af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:26:37, skipping insertion in model container [2018-11-10 03:26:37,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:26:37" (2/3) ... [2018-11-10 03:26:37,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2e6af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:26:37, skipping insertion in model container [2018-11-10 03:26:37,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:26:37" (3/3) ... [2018-11-10 03:26:37,857 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-10 03:26:37,863 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:26:37,867 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 03:26:37,875 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 03:26:37,896 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:26:37,896 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:26:37,896 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:26:37,896 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:26:37,896 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:26:37,897 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:26:37,897 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:26:37,897 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:26:37,897 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:26:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-11-10 03:26:37,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 03:26:37,914 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:37,914 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:37,916 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:37,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:37,920 INFO L82 PathProgramCache]: Analyzing trace with hash -935115767, now seen corresponding path program 1 times [2018-11-10 03:26:37,922 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:26:37,923 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:37,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:38,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:38,039 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-10 03:26:38,039 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:26:38,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:26:38,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:26:38,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 03:26:38,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 03:26:38,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 03:26:38,059 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-11-10 03:26:38,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:38,081 INFO L93 Difference]: Finished difference Result 110 states and 137 transitions. [2018-11-10 03:26:38,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 03:26:38,082 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 49 [2018-11-10 03:26:38,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:38,090 INFO L225 Difference]: With dead ends: 110 [2018-11-10 03:26:38,090 INFO L226 Difference]: Without dead ends: 59 [2018-11-10 03:26:38,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 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-10 03:26:38,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-10 03:26:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-10 03:26:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 03:26:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-11-10 03:26:38,122 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 49 [2018-11-10 03:26:38,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:38,122 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-11-10 03:26:38,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 03:26:38,123 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-10 03:26:38,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 03:26:38,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:38,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:38,125 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:38,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:38,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1553349029, now seen corresponding path program 1 times [2018-11-10 03:26:38,126 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:26:38,126 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:38,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:38,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:38,225 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-10 03:26:38,225 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:26:38,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:26:38,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:26:38,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:26:38,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:26:38,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:26:38,229 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 3 states. [2018-11-10 03:26:38,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:38,259 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2018-11-10 03:26:38,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:26:38,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-10 03:26:38,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:38,260 INFO L225 Difference]: With dead ends: 103 [2018-11-10 03:26:38,261 INFO L226 Difference]: Without dead ends: 64 [2018-11-10 03:26:38,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-10 03:26:38,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-10 03:26:38,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-11-10 03:26:38,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 03:26:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-11-10 03:26:38,269 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 52 [2018-11-10 03:26:38,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:38,269 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-11-10 03:26:38,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:26:38,270 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-11-10 03:26:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 03:26:38,271 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:38,271 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:38,271 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:38,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:38,272 INFO L82 PathProgramCache]: Analyzing trace with hash 737203684, now seen corresponding path program 1 times [2018-11-10 03:26:38,272 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:26:38,272 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:38,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:38,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:38,382 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-10 03:26:38,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:26:38,485 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-10 03:26:38,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:26:38,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-10 03:26:38,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:26:38,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:26:38,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:26:38,489 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 6 states. [2018-11-10 03:26:38,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:38,547 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2018-11-10 03:26:38,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:26:38,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-11-10 03:26:38,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:38,548 INFO L225 Difference]: With dead ends: 108 [2018-11-10 03:26:38,548 INFO L226 Difference]: Without dead ends: 69 [2018-11-10 03:26:38,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 109 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-10 03:26:38,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-10 03:26:38,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-11-10 03:26:38,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-10 03:26:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-11-10 03:26:38,556 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 57 [2018-11-10 03:26:38,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:38,556 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-11-10 03:26:38,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:26:38,556 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-11-10 03:26:38,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 03:26:38,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:38,558 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-11-10 03:26:38,558 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:38,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:38,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1648563195, now seen corresponding path program 2 times [2018-11-10 03:26:38,559 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:26:38,559 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:38,571 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 03:26:38,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 03:26:38,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:26:38,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 03:26:38,641 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 03:26:38,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:26:38,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:26:38,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:26:38,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:26:38,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:26:38,643 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 3 states. [2018-11-10 03:26:38,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:38,666 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2018-11-10 03:26:38,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:26:38,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-11-10 03:26:38,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:38,669 INFO L225 Difference]: With dead ends: 103 [2018-11-10 03:26:38,669 INFO L226 Difference]: Without dead ends: 75 [2018-11-10 03:26:38,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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-10 03:26:38,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-10 03:26:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2018-11-10 03:26:38,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 03:26:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-11-10 03:26:38,676 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 62 [2018-11-10 03:26:38,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:38,676 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-11-10 03:26:38,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:26:38,676 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-11-10 03:26:38,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 03:26:38,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:38,677 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:38,677 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:38,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:38,678 INFO L82 PathProgramCache]: Analyzing trace with hash 745092999, now seen corresponding path program 1 times [2018-11-10 03:26:38,678 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:26:38,678 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:38,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:26:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:38,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:38,916 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-10 03:26:38,919 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-10 03:26:38,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:38,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:38,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:38,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-10 03:26:38,963 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-10 03:26:38,965 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-10 03:26:38,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:38,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:38,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:38,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-10 03:26:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 03:26:39,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:26:39,290 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-10 03:26:39,303 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-10 03:26:39,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:39,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 03:26:39,315 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-10 03:26:39,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-11-10 03:26:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 03:26:39,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:26:39,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2018-11-10 03:26:39,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 03:26:39,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 03:26:39,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2018-11-10 03:26:39,444 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 27 states. [2018-11-10 03:26:40,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:40,689 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-11-10 03:26:40,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 03:26:40,689 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 70 [2018-11-10 03:26:40,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:40,691 INFO L225 Difference]: With dead ends: 133 [2018-11-10 03:26:40,691 INFO L226 Difference]: Without dead ends: 112 [2018-11-10 03:26:40,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=1675, Unknown=0, NotChecked=0, Total=1980 [2018-11-10 03:26:40,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-10 03:26:40,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-11-10 03:26:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-10 03:26:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2018-11-10 03:26:40,701 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 70 [2018-11-10 03:26:40,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:40,701 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2018-11-10 03:26:40,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 03:26:40,701 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2018-11-10 03:26:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 03:26:40,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:40,703 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:40,703 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:40,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:40,703 INFO L82 PathProgramCache]: Analyzing trace with hash 882692284, now seen corresponding path program 1 times [2018-11-10 03:26:40,703 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:26:40,704 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:40,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:40,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:40,807 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 03:26:40,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:26:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 03:26:40,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:26:40,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-10 03:26:40,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:26:40,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:26:40,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:26:40,840 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand 6 states. [2018-11-10 03:26:40,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:40,873 INFO L93 Difference]: Finished difference Result 148 states and 173 transitions. [2018-11-10 03:26:40,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:26:40,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-11-10 03:26:40,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:40,874 INFO L225 Difference]: With dead ends: 148 [2018-11-10 03:26:40,875 INFO L226 Difference]: Without dead ends: 108 [2018-11-10 03:26:40,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 137 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-10 03:26:40,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-10 03:26:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 98. [2018-11-10 03:26:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-10 03:26:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2018-11-10 03:26:40,887 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 71 [2018-11-10 03:26:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:40,887 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2018-11-10 03:26:40,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:26:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2018-11-10 03:26:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-10 03:26:40,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:40,889 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:40,889 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:40,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:40,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1518730494, now seen corresponding path program 1 times [2018-11-10 03:26:40,889 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:26:40,890 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:40,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:41,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:41,068 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-10 03:26:41,070 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-10 03:26:41,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:41,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:41,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:41,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-10 03:26:41,088 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-10 03:26:41,089 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-10 03:26:41,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:41,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:41,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:41,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-10 03:26:41,153 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-10 03:26:41,158 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:26:41,158 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 18 treesize of output 25 [2018-11-10 03:26:41,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:41,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:41,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:41,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 03:26:41,236 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-10 03:26:41,238 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-10 03:26:41,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:41,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:41,251 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-10 03:26:41,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:5 [2018-11-10 03:26:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 03:26:41,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:26:41,499 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 14 treesize of output 12 [2018-11-10 03:26:41,516 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 5 [2018-11-10 03:26:41,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:41,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:41,519 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-10 03:26:41,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-11-10 03:26:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 03:26:41,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:26:41,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2018-11-10 03:26:41,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 03:26:41,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 03:26:41,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-11-10 03:26:41,550 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 19 states. [2018-11-10 03:26:42,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:42,468 INFO L93 Difference]: Finished difference Result 209 states and 243 transitions. [2018-11-10 03:26:42,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 03:26:42,469 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2018-11-10 03:26:42,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:42,471 INFO L225 Difference]: With dead ends: 209 [2018-11-10 03:26:42,471 INFO L226 Difference]: Without dead ends: 193 [2018-11-10 03:26:42,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=342, Invalid=990, Unknown=0, NotChecked=0, Total=1332 [2018-11-10 03:26:42,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-10 03:26:42,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 146. [2018-11-10 03:26:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-10 03:26:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2018-11-10 03:26:42,490 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 75 [2018-11-10 03:26:42,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:42,491 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2018-11-10 03:26:42,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 03:26:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2018-11-10 03:26:42,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 03:26:42,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:42,492 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:42,492 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:42,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:42,492 INFO L82 PathProgramCache]: Analyzing trace with hash 496573323, now seen corresponding path program 1 times [2018-11-10 03:26:42,492 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:26:42,492 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:42,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:42,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:42,617 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-10 03:26:42,618 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-10 03:26:42,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:42,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:42,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:42,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-10 03:26:42,655 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-10 03:26:42,658 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:26:42,659 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-10 03:26:42,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:42,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:42,672 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-10 03:26:42,673 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-10 03:26:42,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:42,675 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:42,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:42,682 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-11-10 03:26:42,700 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-10 03:26:42,702 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-10 03:26:42,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:42,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:42,715 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-10 03:26:42,718 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:26:42,718 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-10 03:26:42,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:42,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:42,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:42,727 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:10 [2018-11-10 03:26:42,981 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-10 03:26:42,984 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:26:42,985 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-10 03:26:42,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:42,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:43,003 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-10 03:26:43,008 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-10 03:26:43,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:43,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:43,022 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-10 03:26:43,022 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:12 [2018-11-10 03:26:43,048 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-10 03:26:43,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, 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-10 03:26:43,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:43,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:43,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:43,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:7 [2018-11-10 03:26:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 3 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 03:26:43,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:26:43,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:26:43,362 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:43,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:26:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:43,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:43,467 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-10 03:26:43,468 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-10 03:26:43,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:43,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:43,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:43,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 03:26:43,503 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-10 03:26:43,505 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-10 03:26:43,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:43,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:43,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:43,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:7 [2018-11-10 03:26:43,590 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-10 03:26:43,592 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:26:43,593 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-10 03:26:43,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:43,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:43,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:43,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-10 03:26:43,720 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-10 03:26:43,722 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-10 03:26:43,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:43,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:43,724 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-10 03:26:43,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:5 [2018-11-10 03:26:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 03:26:43,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:26:44,146 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-10 03:26:44,169 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-10 03:26:44,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:44,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:44,172 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-10 03:26:44,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-11-10 03:26:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 03:26:44,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 03:26:44,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 10] total 36 [2018-11-10 03:26:44,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-10 03:26:44,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-10 03:26:44,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1519, Unknown=15, NotChecked=0, Total=1722 [2018-11-10 03:26:44,290 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand 36 states. [2018-11-10 03:26:51,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:51,198 INFO L93 Difference]: Finished difference Result 434 states and 513 transitions. [2018-11-10 03:26:51,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-10 03:26:51,198 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2018-11-10 03:26:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:51,200 INFO L225 Difference]: With dead ends: 434 [2018-11-10 03:26:51,200 INFO L226 Difference]: Without dead ends: 389 [2018-11-10 03:26:51,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 222 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3251 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1632, Invalid=10285, Unknown=73, NotChecked=0, Total=11990 [2018-11-10 03:26:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-11-10 03:26:51,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 299. [2018-11-10 03:26:51,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-11-10 03:26:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 361 transitions. [2018-11-10 03:26:51,223 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 361 transitions. Word has length 80 [2018-11-10 03:26:51,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:51,223 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 361 transitions. [2018-11-10 03:26:51,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-10 03:26:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 361 transitions. [2018-11-10 03:26:51,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 03:26:51,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:51,225 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:51,225 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:51,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:51,225 INFO L82 PathProgramCache]: Analyzing trace with hash 991360165, now seen corresponding path program 2 times [2018-11-10 03:26:51,225 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:26:51,226 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 03:26:51,241 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 03:26:51,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:26:51,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:26:51,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:51,419 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-10 03:26:51,421 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-10 03:26:51,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:51,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:51,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:51,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 03:26:51,461 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-10 03:26:51,462 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-10 03:26:51,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:51,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:51,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:51,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-10 03:26:51,591 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 03:26:51,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:26:51,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 17 treesize of output 15 [2018-11-10 03:26:51,844 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-10 03:26:51,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:51,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 03:26:51,854 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-10 03:26:51,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-11-10 03:26:52,025 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 03:26:52,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:26:52,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2018-11-10 03:26:52,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-10 03:26:52,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-10 03:26:52,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2018-11-10 03:26:52,028 INFO L87 Difference]: Start difference. First operand 299 states and 361 transitions. Second operand 32 states. [2018-11-10 03:26:54,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:54,059 INFO L93 Difference]: Finished difference Result 410 states and 496 transitions. [2018-11-10 03:26:54,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 03:26:54,060 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 80 [2018-11-10 03:26:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:54,062 INFO L225 Difference]: With dead ends: 410 [2018-11-10 03:26:54,062 INFO L226 Difference]: Without dead ends: 355 [2018-11-10 03:26:54,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=419, Invalid=2661, Unknown=0, NotChecked=0, Total=3080 [2018-11-10 03:26:54,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-11-10 03:26:54,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 297. [2018-11-10 03:26:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-10 03:26:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 358 transitions. [2018-11-10 03:26:54,091 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 358 transitions. Word has length 80 [2018-11-10 03:26:54,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:54,092 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 358 transitions. [2018-11-10 03:26:54,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-10 03:26:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 358 transitions. [2018-11-10 03:26:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 03:26:54,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:54,093 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:54,093 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:54,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:54,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2143548146, now seen corresponding path program 1 times [2018-11-10 03:26:54,094 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:26:54,094 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:54,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:26:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:26:54,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:54,285 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-10 03:26:54,287 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-10 03:26:54,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:54,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:54,299 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-10 03:26:54,301 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-10 03:26:54,301 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:54,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:54,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:54,310 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-10 03:26:54,349 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-10 03:26:54,350 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-10 03:26:54,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:54,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:54,358 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-10 03:26:54,360 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-10 03:26:54,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:54,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:54,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:54,365 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:10 [2018-11-10 03:26:54,435 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-10 03:26:54,437 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-10 03:26:54,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:54,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:54,455 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 16 [2018-11-10 03:26:54,457 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 16 treesize of output 7 [2018-11-10 03:26:54,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:54,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:54,467 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-10 03:26:54,467 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:13 [2018-11-10 03:26:54,497 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:26:54,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:26:54,763 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 14 treesize of output 12 [2018-11-10 03:26:54,775 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 5 treesize of output 3 [2018-11-10 03:26:54,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:54,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 03:26:54,787 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 14 treesize of output 12 [2018-11-10 03:26:54,798 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 5 treesize of output 3 [2018-11-10 03:26:54,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:54,802 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 03:26:54,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 03:26:54,811 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:12 [2018-11-10 03:26:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 03:26:54,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:26:54,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2018-11-10 03:26:54,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-10 03:26:54,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 03:26:54,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-10 03:26:54,901 INFO L87 Difference]: Start difference. First operand 297 states and 358 transitions. Second operand 22 states. [2018-11-10 03:26:56,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:26:56,240 INFO L93 Difference]: Finished difference Result 361 states and 434 transitions. [2018-11-10 03:26:56,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 03:26:56,241 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 81 [2018-11-10 03:26:56,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:26:56,242 INFO L225 Difference]: With dead ends: 361 [2018-11-10 03:26:56,242 INFO L226 Difference]: Without dead ends: 323 [2018-11-10 03:26:56,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2018-11-10 03:26:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-11-10 03:26:56,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 318. [2018-11-10 03:26:56,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-11-10 03:26:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 382 transitions. [2018-11-10 03:26:56,274 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 382 transitions. Word has length 81 [2018-11-10 03:26:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:26:56,274 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 382 transitions. [2018-11-10 03:26:56,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-10 03:26:56,274 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 382 transitions. [2018-11-10 03:26:56,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 03:26:56,275 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:26:56,275 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:26:56,275 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:26:56,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:26:56,276 INFO L82 PathProgramCache]: Analyzing trace with hash -72960162, now seen corresponding path program 2 times [2018-11-10 03:26:56,276 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:26:56,276 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:26:56,298 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 03:26:56,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:26:56,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:26:56,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:26:56,528 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-10 03:26:56,533 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-10 03:26:56,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:56,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:56,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:56,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-10 03:26:56,572 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-10 03:26:56,577 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:26:56,577 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-10 03:26:56,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:56,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:56,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:56,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-10 03:26:56,711 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-10 03:26:56,713 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:26:56,713 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-10 03:26:56,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:56,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:56,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:56,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:7 [2018-11-10 03:26:56,835 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-10 03:26:56,838 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:26:56,841 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-10 03:26:56,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:56,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:56,857 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-10 03:26:56,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:16 [2018-11-10 03:26:56,885 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-10 03:26:56,886 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-10 03:26:56,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:56,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:56,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:56,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-10 03:26:56,942 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-10 03:26:56,943 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-10 03:26:56,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:56,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:56,947 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-10 03:26:56,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-10 03:26:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 38 refuted. 2 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 03:26:56,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:26:57,308 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-10 03:26:57,309 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-10 03:26:57,314 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-10 03:26:57,314 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:57,315 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:57,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:57,316 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-10 03:26:57,317 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-10 03:26:57,427 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-10 03:26:57,429 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-10 03:26:57,493 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 03:26:57,494 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 03:26:57,494 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-10 03:26:57,495 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:57,495 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 03:26:57,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:26:57,499 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:57,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:26:57,507 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-10 03:26:57,507 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:18 [2018-11-10 03:26:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 03:26:57,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:26:57,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 37 [2018-11-10 03:26:57,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-10 03:26:57,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-10 03:26:57,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1144, Unknown=17, NotChecked=0, Total=1332 [2018-11-10 03:26:57,559 INFO L87 Difference]: Start difference. First operand 318 states and 382 transitions. Second operand 37 states. [2018-11-10 03:27:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:27:02,032 INFO L93 Difference]: Finished difference Result 728 states and 889 transitions. [2018-11-10 03:27:02,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-10 03:27:02,032 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 81 [2018-11-10 03:27:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:27:02,034 INFO L225 Difference]: With dead ends: 728 [2018-11-10 03:27:02,034 INFO L226 Difference]: Without dead ends: 600 [2018-11-10 03:27:02,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=894, Invalid=5205, Unknown=63, NotChecked=0, Total=6162 [2018-11-10 03:27:02,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-11-10 03:27:02,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 453. [2018-11-10 03:27:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-11-10 03:27:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 551 transitions. [2018-11-10 03:27:02,070 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 551 transitions. Word has length 81 [2018-11-10 03:27:02,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:27:02,071 INFO L481 AbstractCegarLoop]: Abstraction has 453 states and 551 transitions. [2018-11-10 03:27:02,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-10 03:27:02,071 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 551 transitions. [2018-11-10 03:27:02,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 03:27:02,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:27:02,072 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-11-10 03:27:02,072 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:27:02,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:27:02,072 INFO L82 PathProgramCache]: Analyzing trace with hash 2057796066, now seen corresponding path program 2 times [2018-11-10 03:27:02,073 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:27:02,073 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:27:02,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:27:02,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:27:02,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:27:02,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:27:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 03:27:02,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:27:02,257 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 03:27:02,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:27:02,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-10 03:27:02,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 03:27:02,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 03:27:02,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:27:02,259 INFO L87 Difference]: Start difference. First operand 453 states and 551 transitions. Second operand 8 states. [2018-11-10 03:27:02,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:27:02,309 INFO L93 Difference]: Finished difference Result 650 states and 798 transitions. [2018-11-10 03:27:02,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:27:02,310 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2018-11-10 03:27:02,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:27:02,311 INFO L225 Difference]: With dead ends: 650 [2018-11-10 03:27:02,311 INFO L226 Difference]: Without dead ends: 450 [2018-11-10 03:27:02,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 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-10 03:27:02,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-11-10 03:27:02,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 443. [2018-11-10 03:27:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-11-10 03:27:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 509 transitions. [2018-11-10 03:27:02,336 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 509 transitions. Word has length 85 [2018-11-10 03:27:02,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:27:02,336 INFO L481 AbstractCegarLoop]: Abstraction has 443 states and 509 transitions. [2018-11-10 03:27:02,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 03:27:02,337 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 509 transitions. [2018-11-10 03:27:02,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 03:27:02,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:27:02,338 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:27:02,338 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:27:02,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:27:02,338 INFO L82 PathProgramCache]: Analyzing trace with hash 51775190, now seen corresponding path program 1 times [2018-11-10 03:27:02,339 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:27:02,339 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:27:02,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:27:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:27:02,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:27:02,494 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-10 03:27:02,496 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-10 03:27:02,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:02,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:02,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:02,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-10 03:27:02,621 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-10 03:27:02,622 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-10 03:27:02,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:02,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:02,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:02,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-10 03:27:02,719 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-10 03:27:02,723 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:27:02,725 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-10 03:27:02,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:02,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:02,746 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-10 03:27:02,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-11-10 03:27:02,749 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-10 03:27:02,759 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-10 03:27:02,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:02,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:02,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:02,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-10 03:27:02,903 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-10 03:27:02,904 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-10 03:27:02,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:02,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:02,908 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-10 03:27:02,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-10 03:27:02,930 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 29 refuted. 2 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 03:27:02,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:27:03,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 15 [2018-11-10 03:27:03,483 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-10 03:27:03,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:03,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:03,492 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-10 03:27:03,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-11-10 03:27:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 03:27:03,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:27:03,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2018-11-10 03:27:03,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-10 03:27:03,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-10 03:27:03,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=983, Unknown=15, NotChecked=0, Total=1122 [2018-11-10 03:27:03,580 INFO L87 Difference]: Start difference. First operand 443 states and 509 transitions. Second operand 34 states. [2018-11-10 03:27:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:27:06,926 INFO L93 Difference]: Finished difference Result 564 states and 648 transitions. [2018-11-10 03:27:06,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-10 03:27:06,927 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 85 [2018-11-10 03:27:06,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:27:06,928 INFO L225 Difference]: With dead ends: 564 [2018-11-10 03:27:06,928 INFO L226 Difference]: Without dead ends: 506 [2018-11-10 03:27:06,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=501, Invalid=3116, Unknown=43, NotChecked=0, Total=3660 [2018-11-10 03:27:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-11-10 03:27:06,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 443. [2018-11-10 03:27:06,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-11-10 03:27:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 506 transitions. [2018-11-10 03:27:06,967 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 506 transitions. Word has length 85 [2018-11-10 03:27:06,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:27:06,968 INFO L481 AbstractCegarLoop]: Abstraction has 443 states and 506 transitions. [2018-11-10 03:27:06,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-10 03:27:06,968 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 506 transitions. [2018-11-10 03:27:06,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 03:27:06,969 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:27:06,969 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-11-10 03:27:06,969 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:27:06,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:27:06,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1152958200, now seen corresponding path program 3 times [2018-11-10 03:27:06,970 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:27:06,970 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:27:06,990 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-10 03:27:07,156 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 03:27:07,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:27:07,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:27:07,241 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-10 03:27:07,243 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-10 03:27:07,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:07,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:07,253 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-10 03:27:07,255 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-10 03:27:07,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:07,257 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:07,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:07,263 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-10 03:27:07,302 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-10 03:27:07,303 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-10 03:27:07,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:07,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:07,311 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-10 03:27:07,312 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-10 03:27:07,312 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:07,313 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:07,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:07,317 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-11-10 03:27:07,452 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-10 03:27:07,457 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:27:07,459 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 18 treesize of output 27 [2018-11-10 03:27:07,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:07,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:07,512 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 34 treesize of output 27 [2018-11-10 03:27:07,518 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:27:09,529 WARN L686 Elim1Store]: solver failed to check if following not equals relation is implied: (= (select v_arrayElimCell_57 |~#pp~0.offset|) (select v_arrayElimCell_57 (bvadd (bvmul (_ bv4 32) f_~i~1) |~#pp~0.offset|))) [2018-11-10 03:27:09,534 INFO L303 Elim1Store]: Index analysis took 2021 ms [2018-11-10 03:27:09,534 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 27 treesize of output 30 [2018-11-10 03:27:09,535 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:09,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:09,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:27:09,564 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:67, output treesize:34 [2018-11-10 03:27:09,640 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-10 03:27:09,642 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-10 03:27:09,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:09,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:09,651 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 16 [2018-11-10 03:27:09,653 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 16 treesize of output 7 [2018-11-10 03:27:09,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:09,655 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:09,660 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-10 03:27:09,660 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:13 [2018-11-10 03:27:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 03:27:09,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:27:10,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:27:10,010 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:27:10,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 03:27:10,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 03:27:10,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:27:10,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:27:10,299 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-10 03:27:10,300 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-10 03:27:10,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:10,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:10,312 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-10 03:27:10,314 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-10 03:27:10,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:10,316 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:10,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:10,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-10 03:27:10,367 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-10 03:27:10,368 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-10 03:27:10,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:10,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:10,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:10,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2018-11-10 03:27:10,384 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 34 treesize of output 27 [2018-11-10 03:27:10,389 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:27:12,403 WARN L686 Elim1Store]: solver failed to check if following not equals relation is implied: (= (select v_arrayElimCell_63 |~#pp~0.offset|) (select v_arrayElimCell_63 (bvadd (bvmul (_ bv4 32) f_~i~1) |~#pp~0.offset|))) [2018-11-10 03:27:12,409 INFO L303 Elim1Store]: Index analysis took 2023 ms [2018-11-10 03:27:12,409 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 27 treesize of output 30 [2018-11-10 03:27:12,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:12,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:12,446 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-10 03:27:12,450 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:27:12,452 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 18 treesize of output 27 [2018-11-10 03:27:12,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:12,460 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:12,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 03:27:12,480 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:64, output treesize:31 [2018-11-10 03:27:12,614 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-10 03:27:12,615 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-10 03:27:12,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:12,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:12,625 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-10 03:27:12,627 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-10 03:27:12,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:12,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:12,631 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-10 03:27:12,632 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10 [2018-11-10 03:27:12,664 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 03:27:12,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:27:15,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:27:15,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 25 [2018-11-10 03:27:15,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-10 03:27:15,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 03:27:15,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=807, Unknown=19, NotChecked=0, Total=930 [2018-11-10 03:27:15,444 INFO L87 Difference]: Start difference. First operand 443 states and 506 transitions. Second operand 25 states. [2018-11-10 03:27:17,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:27:17,235 INFO L93 Difference]: Finished difference Result 538 states and 611 transitions. [2018-11-10 03:27:17,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 03:27:17,235 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2018-11-10 03:27:17,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:27:17,236 INFO L225 Difference]: With dead ends: 538 [2018-11-10 03:27:17,237 INFO L226 Difference]: Without dead ends: 476 [2018-11-10 03:27:17,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 169 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=221, Invalid=1718, Unknown=41, NotChecked=0, Total=1980 [2018-11-10 03:27:17,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-11-10 03:27:17,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 471. [2018-11-10 03:27:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-11-10 03:27:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 536 transitions. [2018-11-10 03:27:17,264 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 536 transitions. Word has length 85 [2018-11-10 03:27:17,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:27:17,264 INFO L481 AbstractCegarLoop]: Abstraction has 471 states and 536 transitions. [2018-11-10 03:27:17,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-10 03:27:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 536 transitions. [2018-11-10 03:27:17,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 03:27:17,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:27:17,265 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-11-10 03:27:17,266 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:27:17,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:27:17,266 INFO L82 PathProgramCache]: Analyzing trace with hash -7292984, now seen corresponding path program 4 times [2018-11-10 03:27:17,266 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:27:17,266 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/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-10 03:27:17,285 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 03:27:17,345 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 03:27:17,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:27:17,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:27:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 03:27:17,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:27:17,413 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 03:27:17,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:27:17,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-10 03:27:17,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 03:27:17,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 03:27:17,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:27:17,416 INFO L87 Difference]: Start difference. First operand 471 states and 536 transitions. Second operand 8 states. [2018-11-10 03:27:17,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:27:17,487 INFO L93 Difference]: Finished difference Result 622 states and 698 transitions. [2018-11-10 03:27:17,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:27:17,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2018-11-10 03:27:17,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:27:17,489 INFO L225 Difference]: With dead ends: 622 [2018-11-10 03:27:17,489 INFO L226 Difference]: Without dead ends: 235 [2018-11-10 03:27:17,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 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-10 03:27:17,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-10 03:27:17,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 213. [2018-11-10 03:27:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-10 03:27:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 222 transitions. [2018-11-10 03:27:17,506 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 222 transitions. Word has length 85 [2018-11-10 03:27:17,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:27:17,506 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 222 transitions. [2018-11-10 03:27:17,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 03:27:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 222 transitions. [2018-11-10 03:27:17,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 03:27:17,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:27:17,507 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:27:17,507 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:27:17,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:27:17,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1561738813, now seen corresponding path program 1 times [2018-11-10 03:27:17,508 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:27:17,508 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/cvc4nyu Starting monitored process 19 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 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 03:27:17,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:27:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:27:17,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:27:17,872 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-10 03:27:17,874 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-10 03:27:17,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:17,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:17,881 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-10 03:27:17,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2018-11-10 03:27:17,908 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 03:27:17,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:27:18,005 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-10 03:27:18,007 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-10 03:27:18,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:18,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:18,011 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-10 03:27:18,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:4 [2018-11-10 03:27:18,093 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-10 03:27:18,105 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-10 03:27:18,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 03:27:18,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 03:27:18,117 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-10 03:27:18,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:11 [2018-11-10 03:27:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 03:27:18,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:27:18,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2018-11-10 03:27:18,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-10 03:27:18,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-10 03:27:18,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2018-11-10 03:27:18,369 INFO L87 Difference]: Start difference. First operand 213 states and 222 transitions. Second operand 32 states. [2018-11-10 03:27:20,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:27:20,110 INFO L93 Difference]: Finished difference Result 256 states and 266 transitions. [2018-11-10 03:27:20,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 03:27:20,111 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 95 [2018-11-10 03:27:20,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:27:20,111 INFO L225 Difference]: With dead ends: 256 [2018-11-10 03:27:20,112 INFO L226 Difference]: Without dead ends: 242 [2018-11-10 03:27:20,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=198, Invalid=1608, Unknown=0, NotChecked=0, Total=1806 [2018-11-10 03:27:20,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-11-10 03:27:20,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 219. [2018-11-10 03:27:20,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-10 03:27:20,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 228 transitions. [2018-11-10 03:27:20,138 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 228 transitions. Word has length 95 [2018-11-10 03:27:20,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:27:20,138 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 228 transitions. [2018-11-10 03:27:20,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-10 03:27:20,138 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 228 transitions. [2018-11-10 03:27:20,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 03:27:20,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:27:20,139 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:27:20,139 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:27:20,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:27:20,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1167866337, now seen corresponding path program 1 times [2018-11-10 03:27:20,140 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:27:20,140 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/cvc4nyu Starting monitored process 20 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 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 03:27:20,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:27:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:27:20,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:27:20,395 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-10 03:27:20,398 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-10 03:27:20,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:20,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:20,418 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-10 03:27:20,420 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-10 03:27:20,421 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:20,424 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:20,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:20,435 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-11-10 03:27:20,513 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-10 03:27:20,515 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-10 03:27:20,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:20,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:20,523 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-10 03:27:20,524 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-10 03:27:20,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:20,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:20,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:20,529 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:10 [2018-11-10 03:27:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 12 proven. 47 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 03:27:20,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:27:21,255 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-10 03:27:21,270 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-10 03:27:21,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:21,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 03:27:21,288 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-10 03:27:21,306 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-10 03:27:21,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:21,312 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 03:27:21,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 03:27:21,320 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:12 [2018-11-10 03:27:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 03:27:21,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:27:21,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 28 [2018-11-10 03:27:21,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-10 03:27:21,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-10 03:27:21,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2018-11-10 03:27:21,464 INFO L87 Difference]: Start difference. First operand 219 states and 228 transitions. Second operand 28 states. [2018-11-10 03:27:24,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:27:24,533 INFO L93 Difference]: Finished difference Result 289 states and 299 transitions. [2018-11-10 03:27:24,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 03:27:24,533 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 97 [2018-11-10 03:27:24,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:27:24,534 INFO L225 Difference]: With dead ends: 289 [2018-11-10 03:27:24,534 INFO L226 Difference]: Without dead ends: 273 [2018-11-10 03:27:24,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=333, Invalid=2217, Unknown=0, NotChecked=0, Total=2550 [2018-11-10 03:27:24,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-11-10 03:27:24,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 239. [2018-11-10 03:27:24,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-11-10 03:27:24,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 248 transitions. [2018-11-10 03:27:24,564 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 248 transitions. Word has length 97 [2018-11-10 03:27:24,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:27:24,564 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 248 transitions. [2018-11-10 03:27:24,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-10 03:27:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 248 transitions. [2018-11-10 03:27:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 03:27:24,565 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:27:24,566 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:27:24,566 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:27:24,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:27:24,566 INFO L82 PathProgramCache]: Analyzing trace with hash 496880747, now seen corresponding path program 2 times [2018-11-10 03:27:24,566 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:27:24,566 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/cvc4nyu Starting monitored process 21 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 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 03:27:24,586 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 03:27:24,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:27:24,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:27:24,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:27:24,758 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-10 03:27:24,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 10 treesize of output 9 [2018-11-10 03:27:24,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:24,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:24,773 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-10 03:27:24,775 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-10 03:27:24,775 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:24,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:24,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:24,784 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-11-10 03:27:24,801 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-10 03:27:24,802 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-10 03:27:24,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:24,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:24,815 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-10 03:27:24,816 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-10 03:27:24,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:24,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:24,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:24,821 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:10 [2018-11-10 03:27:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 25 proven. 18 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 03:27:24,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:27:25,165 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-10 03:27:25,181 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-10 03:27:25,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:25,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:25,187 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-10 03:27:25,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:5 [2018-11-10 03:27:25,241 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 16 proven. 38 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 03:27:25,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:27:25,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-11-10 03:27:25,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 03:27:25,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 03:27:25,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-11-10 03:27:25,243 INFO L87 Difference]: Start difference. First operand 239 states and 248 transitions. Second operand 19 states. [2018-11-10 03:27:25,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:27:25,942 INFO L93 Difference]: Finished difference Result 277 states and 287 transitions. [2018-11-10 03:27:25,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 03:27:25,942 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2018-11-10 03:27:25,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:27:25,943 INFO L225 Difference]: With dead ends: 277 [2018-11-10 03:27:25,943 INFO L226 Difference]: Without dead ends: 163 [2018-11-10 03:27:25,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2018-11-10 03:27:25,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-10 03:27:25,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2018-11-10 03:27:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-10 03:27:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 164 transitions. [2018-11-10 03:27:25,955 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 164 transitions. Word has length 97 [2018-11-10 03:27:25,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:27:25,956 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 164 transitions. [2018-11-10 03:27:25,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 03:27:25,956 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2018-11-10 03:27:25,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 03:27:25,956 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:27:25,956 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:27:25,957 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:27:25,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:27:25,957 INFO L82 PathProgramCache]: Analyzing trace with hash 789898482, now seen corresponding path program 2 times [2018-11-10 03:27:25,957 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:27:25,957 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/cvc4nyu Starting monitored process 22 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 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 03:27:25,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:27:26,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:27:26,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:27:26,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:27:26,180 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-10 03:27:26,182 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-10 03:27:26,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:26,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:26,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:26,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 03:27:26,208 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-10 03:27:26,209 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-10 03:27:26,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:26,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:26,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:26,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:7 [2018-11-10 03:27:26,250 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-10 03:27:26,253 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:27:26,253 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:27:26,254 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-10 03:27:26,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:26,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:26,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:26,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 03:27:26,320 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-10 03:27:26,322 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:27:26,322 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-10 03:27:26,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:26,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:26,325 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-10 03:27:26,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:5 [2018-11-10 03:27:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 03:27:26,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:27:26,519 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-10 03:27:26,534 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-10 03:27:26,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:26,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:26,537 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-10 03:27:26,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-11-10 03:27:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 38 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 03:27:26,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:27:26,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2018-11-10 03:27:26,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-10 03:27:26,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 03:27:26,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-11-10 03:27:26,593 INFO L87 Difference]: Start difference. First operand 160 states and 164 transitions. Second operand 21 states. [2018-11-10 03:27:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:27:27,928 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2018-11-10 03:27:27,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-10 03:27:27,928 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 100 [2018-11-10 03:27:27,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:27:27,929 INFO L225 Difference]: With dead ends: 194 [2018-11-10 03:27:27,929 INFO L226 Difference]: Without dead ends: 173 [2018-11-10 03:27:27,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=358, Invalid=1712, Unknown=0, NotChecked=0, Total=2070 [2018-11-10 03:27:27,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-10 03:27:27,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 160. [2018-11-10 03:27:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-10 03:27:27,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 163 transitions. [2018-11-10 03:27:27,948 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 163 transitions. Word has length 100 [2018-11-10 03:27:27,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:27:27,949 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 163 transitions. [2018-11-10 03:27:27,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-10 03:27:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 163 transitions. [2018-11-10 03:27:27,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 03:27:27,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:27:27,950 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:27:27,950 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:27:27,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:27:27,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1095574953, now seen corresponding path program 1 times [2018-11-10 03:27:27,950 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:27:27,950 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/cvc4nyu Starting monitored process 23 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 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 03:27:27,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:27:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:27:28,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:27:28,098 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-10 03:27:28,100 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-10 03:27:28,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:28,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:28,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:28,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-10 03:27:28,135 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-10 03:27:28,137 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:27:28,137 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-10 03:27:28,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:28,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:28,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:28,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-10 03:27:28,267 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-10 03:27:28,268 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:27:28,268 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-10 03:27:28,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:28,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:28,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:28,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:7 [2018-11-10 03:27:28,366 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-10 03:27:28,368 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:27:28,371 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-10 03:27:28,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:28,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:28,383 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-10 03:27:28,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:16 [2018-11-10 03:27:28,407 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-10 03:27:28,408 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-10 03:27:28,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:28,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:28,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:28,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-10 03:27:28,495 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-10 03:27:28,496 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-10 03:27:28,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:28,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:28,500 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-10 03:27:28,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-10 03:27:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 11 proven. 39 refuted. 2 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 03:27:28,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:27:29,010 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 18 treesize of output 16 [2018-11-10 03:27:29,011 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 16 treesize of output 20 [2018-11-10 03:27:29,016 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 15 treesize of output 6 [2018-11-10 03:27:29,016 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:29,017 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:29,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:29,019 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-10 03:27:29,020 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:6 [2018-11-10 03:27:29,238 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 25 treesize of output 23 [2018-11-10 03:27:29,240 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 23 treesize of output 27 [2018-11-10 03:27:31,263 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= |~#pp~0.offset| (bvadd (bvmul (_ bv4 32) init_~i~0) |~#pp~0.offset|)) [2018-11-10 03:27:31,264 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 03:27:31,265 INFO L303 Elim1Store]: Index analysis took 2005 ms [2018-11-10 03:27:31,265 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 26 treesize of output 20 [2018-11-10 03:27:31,265 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:31,266 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 03:27:31,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:31,271 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:31,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:31,279 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-10 03:27:31,279 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-11-10 03:27:31,357 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 34 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 03:27:31,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:27:31,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 42 [2018-11-10 03:27:31,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-10 03:27:31,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-10 03:27:31,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1488, Unknown=19, NotChecked=0, Total=1722 [2018-11-10 03:27:31,360 INFO L87 Difference]: Start difference. First operand 160 states and 163 transitions. Second operand 42 states. [2018-11-10 03:27:35,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:27:35,186 INFO L93 Difference]: Finished difference Result 194 states and 200 transitions. [2018-11-10 03:27:35,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-10 03:27:35,186 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 101 [2018-11-10 03:27:35,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:27:35,187 INFO L225 Difference]: With dead ends: 194 [2018-11-10 03:27:35,187 INFO L226 Difference]: Without dead ends: 180 [2018-11-10 03:27:35,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 162 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1592 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1003, Invalid=5255, Unknown=62, NotChecked=0, Total=6320 [2018-11-10 03:27:35,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-10 03:27:35,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 150. [2018-11-10 03:27:35,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-10 03:27:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-11-10 03:27:35,199 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 101 [2018-11-10 03:27:35,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:27:35,200 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-11-10 03:27:35,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-10 03:27:35,200 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-11-10 03:27:35,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 03:27:35,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:27:35,200 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:27:35,200 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:27:35,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:27:35,200 INFO L82 PathProgramCache]: Analyzing trace with hash 105964586, now seen corresponding path program 3 times [2018-11-10 03:27:35,201 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 03:27:35,201 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/cvc4nyu Starting monitored process 24 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 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 03:27:35,212 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-10 03:27:35,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 03:27:35,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:27:35,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:27:36,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 21 treesize of output 17 [2018-11-10 03:27:36,119 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 03:27:36,120 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-10 03:27:36,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:36,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:36,144 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-10 03:27:36,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:9 [2018-11-10 03:27:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 11 proven. 41 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 03:27:36,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 03:27:36,447 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 20 [2018-11-10 03:27:36,453 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 03:27:36,454 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 20 treesize of output 16 [2018-11-10 03:27:36,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 03:27:36,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 03:27:36,470 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-10 03:27:36,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:4 [2018-11-10 03:27:36,708 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 18 [2018-11-10 03:27:36,717 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 18 treesize of output 18 [2018-11-10 03:27:36,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 03:27:36,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 03:27:36,731 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-10 03:27:36,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-11-10 03:27:37,115 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 03:27:37,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:27:37,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 41 [2018-11-10 03:27:37,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-10 03:27:37,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-10 03:27:37,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1498, Unknown=0, NotChecked=0, Total=1640 [2018-11-10 03:27:37,117 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 41 states. [2018-11-10 03:27:40,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:27:40,798 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2018-11-10 03:27:40,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 03:27:40,798 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 104 [2018-11-10 03:27:40,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:27:40,799 INFO L225 Difference]: With dead ends: 150 [2018-11-10 03:27:40,799 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 03:27:40,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=423, Invalid=3359, Unknown=0, NotChecked=0, Total=3782 [2018-11-10 03:27:40,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 03:27:40,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 03:27:40,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 03:27:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 03:27:40,800 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2018-11-10 03:27:40,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:27:40,800 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:27:40,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-10 03:27:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:27:40,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 03:27:40,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 03:27:41,024 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 139 [2018-11-10 03:27:41,159 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 174 [2018-11-10 03:27:42,076 WARN L179 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 75 [2018-11-10 03:27:42,242 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 52 [2018-11-10 03:27:48,158 WARN L179 SmtUtils]: Spent 5.91 s on a formula simplification. DAG size of input: 308 DAG size of output: 159 [2018-11-10 03:27:48,298 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2018-11-10 03:27:48,458 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2018-11-10 03:27:48,693 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2018-11-10 03:27:49,952 WARN L179 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 172 DAG size of output: 85 [2018-11-10 03:27:50,203 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 56 [2018-11-10 03:27:50,358 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2018-11-10 03:27:50,639 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2018-11-10 03:27:50,961 WARN L179 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 77 [2018-11-10 03:27:51,128 INFO L425 ceAbstractionStarter]: For program point L19(lines 17 20) no Hoare annotation was computed. [2018-11-10 03:27:51,128 INFO L421 ceAbstractionStarter]: At program point initENTRY(lines 15 21) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (not (= (select .cse0 |~#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 .cse0 .cse1))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) .cse1) (_ bv0 32))))) [2018-11-10 03:27:51,128 INFO L425 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-10 03:27:51,129 INFO L425 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2018-11-10 03:27:51,129 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 17 20) no Hoare annotation was computed. [2018-11-10 03:27:51,129 INFO L421 ceAbstractionStarter]: At program point L17-3(lines 17 20) the Hoare annotation is: (let ((.cse3 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse0 (select .cse3 |~#pp~0.offset|)) (.cse2 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (not (= .cse0 (_ bv0 32))) (not (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (_ bv0 32) (select .cse1 .cse2)) (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse2) (_ bv0 32)) (= (select .cse1 |~#pp~0.offset|) .cse0))) (not (= (_ bv0 32) (select .cse3 .cse2))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) .cse2) (_ bv0 32)))))) [2018-11-10 03:27:51,129 INFO L425 ceAbstractionStarter]: For program point L17-4(lines 15 21) no Hoare annotation was computed. [2018-11-10 03:27:51,129 INFO L425 ceAbstractionStarter]: For program point initEXIT(lines 15 21) no Hoare annotation was computed. [2018-11-10 03:27:51,129 INFO L425 ceAbstractionStarter]: For program point mallocFINAL(lines 46 49) no Hoare annotation was computed. [2018-11-10 03:27:51,129 INFO L425 ceAbstractionStarter]: For program point mallocEXIT(lines 46 49) no Hoare annotation was computed. [2018-11-10 03:27:51,129 INFO L421 ceAbstractionStarter]: At program point mallocENTRY(lines 46 49) the Hoare annotation is: (let ((.cse5 (bvadd |~#pp~0.offset| (_ bv4 32))) (.cse6 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse0 (not (= (select .cse6 |~#pp~0.offset|) (_ bv0 32)))) (.cse1 (not (= (_ bv0 32) (select .cse6 .cse5)))) (.cse2 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse3 (not (= (_ bv0 32) |~#pp~0.offset|))) (.cse4 (not (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse5) (_ bv0 32))))) (and (or .cse0 (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse1 .cse2 .cse3 .cse4 (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32))) (or .cse0 (not (= (bvadd |old(~counter~0)| (_ bv4294967294 32)) (_ bv0 32))) (= (bvadd ~counter~0 (_ bv4294967294 32)) (_ bv0 32)) .cse1 .cse2 .cse3 .cse4)))) [2018-11-10 03:27:51,129 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 03:27:51,129 INFO L425 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-11-10 03:27:51,129 INFO L425 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2018-11-10 03:27:51,129 INFO L425 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2018-11-10 03:27:51,129 INFO L425 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. [2018-11-10 03:27:51,129 INFO L425 ceAbstractionStarter]: For program point L13-2(line 13) no Hoare annotation was computed. [2018-11-10 03:27:51,129 INFO L425 ceAbstractionStarter]: For program point L12-2(line 12) no Hoare annotation was computed. [2018-11-10 03:27:51,129 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse1 (bvadd |~#pp~0.offset| (_ bv4 32))) (.cse4 (select |#memory_int| |~#pstate~0.base|)) (.cse3 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse6 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse5 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (and (= (select .cse0 .cse1) (select .cse2 .cse1)) (or (not (= (bvadd (select .cse3 |~#pstate~0.offset|) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv1 32) (select .cse4 |~#pstate~0.offset|))) (= (select .cse0 |~#pp~0.offset|) (select .cse2 |~#pp~0.offset|)) (= |old(~counter~0)| ~counter~0) (= (select .cse5 .cse1) (select .cse6 .cse1)) (let ((.cse7 (bvadd |~#pstate~0.offset| (_ bv4 32)))) (or (= (bvadd (select .cse4 .cse7) (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv1 32) (select .cse3 .cse7))))) (= (select .cse6 |~#pp~0.offset|) (select .cse5 |~#pp~0.offset|)))) [2018-11-10 03:27:51,130 INFO L425 ceAbstractionStarter]: For program point L12-3(line 12) no Hoare annotation was computed. [2018-11-10 03:27:51,130 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:27:51,130 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-10 03:27:51,130 INFO L425 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-11-10 03:27:51,130 INFO L425 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2018-11-10 03:27:51,130 INFO L425 ceAbstractionStarter]: For program point L26-1(lines 26 30) no Hoare annotation was computed. [2018-11-10 03:27:51,130 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 25 31) no Hoare annotation was computed. [2018-11-10 03:27:51,130 INFO L425 ceAbstractionStarter]: For program point L25-3(lines 25 31) no Hoare annotation was computed. [2018-11-10 03:27:51,130 INFO L421 ceAbstractionStarter]: At program point L25-4(lines 25 31) the Hoare annotation is: (let ((.cse20 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse19 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse15 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse10 (select .cse20 .cse19)) (.cse7 (select .cse20 |~#pp~0.offset|)) (.cse12 (= |old(#memory_int)| |#memory_int|)) (.cse16 (= |f_#in~pointer.offset| f_~pointer.offset)) (.cse13 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse17 (= f_~pointer.base |f_#in~pointer.base|)) (.cse18 (= (bvadd f_~i~1 (_ bv4294967295 32)) (_ bv0 32))) (.cse14 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (let ((.cse2 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse3 (and .cse12 .cse16 .cse13 .cse17 .cse18 .cse14)) (.cse0 (= (bvadd ~counter~0 (_ bv1 32)) (_ bv0 32))) (.cse9 (not (= .cse7 (_ bv0 32)))) (.cse11 (= .cse7 ~counter~0)) (.cse4 (not (= (_ bv0 32) .cse10))) (.cse5 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse1 (and .cse12 .cse16 .cse13 .cse17 .cse14 (= f_~i~1 (_ bv0 32)))) (.cse6 (not (= (_ bv0 32) |~#pp~0.offset|))) (.cse8 (not (= (select .cse15 .cse19) (_ bv0 32))))) (and (or .cse0 .cse1 (not (= (_ bv1 32) (select .cse2 |~#pstate~0.offset|))) .cse3 .cse4 .cse5 .cse6 (not (= (bvadd .cse7 (_ bv4294967295 32)) (_ bv0 32))) .cse8) (or .cse9 (not (= (_ bv1 32) .cse10)) .cse11 .cse5 .cse0 .cse1 (not (= (_ bv1 32) (select .cse2 (bvadd |~#pstate~0.offset| (_ bv4 32))))) (and .cse12 (= (_ bv2 32) f_~i~1) .cse13 .cse14) (= (select .cse15 |~#pp~0.offset|) (_ bv0 32)) .cse6 .cse3 .cse8) (or .cse0 .cse9 (and .cse12 .cse16 .cse13 .cse17 .cse18 .cse14 (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|)))) .cse11 .cse4 .cse5 .cse1 .cse6 .cse8))))) [2018-11-10 03:27:51,130 INFO L425 ceAbstractionStarter]: For program point L25-5(lines 23 32) no Hoare annotation was computed. [2018-11-10 03:27:51,130 INFO L425 ceAbstractionStarter]: For program point fEXIT(lines 23 32) no Hoare annotation was computed. [2018-11-10 03:27:51,130 INFO L421 ceAbstractionStarter]: At program point fENTRY(lines 23 32) the Hoare annotation is: (let ((.cse13 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse12 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse6 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (select .cse13 .cse12)) (.cse11 (select .cse13 |~#pp~0.offset|))) (let ((.cse1 (not (= .cse11 (_ bv0 32)))) (.cse5 (= .cse11 ~counter~0)) (.cse0 (= (bvadd ~counter~0 (_ bv1 32)) (_ bv0 32))) (.cse3 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse10 (not (= (_ bv0 32) .cse2))) (.cse7 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse8 (not (= (_ bv0 32) |~#pp~0.offset|))) (.cse4 (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (.cse9 (not (= (select .cse6 .cse12) (_ bv0 32))))) (and (or .cse0 .cse1 (not (= (_ bv1 32) .cse2)) (not (= (_ bv1 32) (select .cse3 (bvadd |~#pstate~0.offset| (_ bv4 32))))) .cse4 .cse5 (= (select .cse6 |~#pp~0.offset|) (_ bv0 32)) .cse7 .cse8 .cse9) (or .cse4 .cse0 .cse1 .cse5 .cse10 .cse7 .cse8 .cse9) (or .cse0 (not (= (_ bv1 32) (select .cse3 |~#pstate~0.offset|))) .cse10 .cse7 .cse8 .cse4 (not (= (bvadd .cse11 (_ bv4294967295 32)) (_ bv0 32))) .cse9))))) [2018-11-10 03:27:51,130 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-10 03:27:51,130 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 36 42) no Hoare annotation was computed. [2018-11-10 03:27:51,130 INFO L425 ceAbstractionStarter]: For program point L36-3(lines 36 42) no Hoare annotation was computed. [2018-11-10 03:27:51,131 INFO L421 ceAbstractionStarter]: At program point L36-4(lines 36 42) the Hoare annotation is: (let ((.cse36 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse31 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse41 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse38 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse2 (select .cse31 .cse41)) (.cse16 (select .cse36 .cse41))) (let ((.cse21 (bvmul (_ bv4 32) g_~i~2)) (.cse13 (not (= |g_#in~pointer.base| .cse16))) (.cse37 (not (= |g_#in~pointer.offset| .cse2))) (.cse25 (= |~#pstate~0.offset| (_ bv0 32))) (.cse14 (= (_ bv2 32) g_~i~2)) (.cse34 (select .cse38 |~#pstate~0.offset|)) (.cse39 (bvadd |~#pstate~0.offset| (_ bv4 32))) (.cse32 (= (_ bv1 32) |g_#in~pointer.offset|)) (.cse26 (select .cse31 |~#pp~0.offset|))) (let ((.cse0 (not (= .cse26 (_ bv0 32)))) (.cse3 (= .cse26 ~counter~0)) (.cse6 (= |old(#memory_int)| |#memory_int|)) (.cse20 (select |#memory_int| |~#pstate~0.base|)) (.cse1 (not .cse32)) (.cse17 (= (store |old(#memory_int)| |~#pstate~0.base| (store .cse38 .cse39 (_ bv1 32))) |#memory_int|)) (.cse10 (= (bvadd ~counter~0 (_ bv1 32)) (_ bv0 32))) (.cse19 (not (= (_ bv1 32) .cse34))) (.cse4 (select .cse36 |~#pp~0.offset|)) (.cse18 (and .cse25 .cse14)) (.cse11 (= (bvadd g_~i~2 (_ bv4294967295 32)) (_ bv0 32))) (.cse29 (or (let ((.cse40 (bvadd .cse21 |~#pp~0.offset|))) (and (= (select .cse31 .cse40) g_~pointer.offset) (= g_~pointer.base (select .cse36 .cse40)))) .cse13 .cse37)) (.cse12 (not (= (_ bv1 32) (select .cse38 .cse39)))) (.cse8 (= g_~i~2 (_ bv0 32))) (.cse24 (= (store |old(#memory_int)| |~#pstate~0.base| (store .cse38 |~#pstate~0.offset| (_ bv2 32))) |#memory_int|)) (.cse9 (= |g_#in~pointer.offset| g_~pointer.offset)) (.cse5 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse15 (not (= (_ bv0 32) |~#pp~0.offset|))) (.cse22 (not (= (bvadd .cse26 (_ bv4294967295 32)) (_ bv0 32))))) (and (let ((.cse7 (= |g_#in~pointer.base| g_~pointer.base))) (or .cse0 .cse1 (not (= (_ bv1 32) .cse2)) .cse3 (or (= .cse4 (_ bv0 32)) .cse5) (and .cse6 .cse7 .cse8 .cse9) .cse10 (and .cse6 .cse7 .cse11 .cse9) .cse12 (and .cse6 .cse13 .cse14) .cse15 (and .cse14 .cse9) (not (= .cse16 (_ bv0 32))))) (or (and .cse8 .cse17) .cse18 .cse12 .cse19 (and .cse11 (= (bvadd (select .cse20 (bvadd .cse21 |~#pstate~0.offset|)) (_ bv4294967295 32)) (_ bv0 32))) .cse5 .cse15) (or (and (and .cse6 .cse8) .cse9) (and (or .cse10 .cse0 .cse3 .cse5) (or .cse10 .cse5 .cse22)) .cse18 (and (let ((.cse23 (or (and .cse25 .cse11) (and .cse8 (and .cse25 (or (= ~counter~0 (_ bv0 32)) (not (= ~counter~0 .cse26))) .cse6 (= (_ bv1 32) (select .cse20 (bvadd .cse21 |~#pstate~0.offset| (_ bv4 32))))))))) (or (and .cse6 .cse23) (and .cse23 .cse24))) .cse9) (forall ((g_~i~2 (_ BitVec 32))) (or (not (= (_ bv1 32) (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (bvadd (bvmul (_ bv4 32) g_~i~2) |~#pp~0.offset| (_ bv4294967292 32))))) (bvslt g_~i~2 (_ bv2 32)) (not (bvslt (bvadd g_~i~2 (_ bv4294967295 32)) (_ bv2 32))))) .cse15 (not (= (_ bv2 32) |g_#in~pointer.offset|))) (let ((.cse28 (= |g_#in~pointer.base| .cse4)) (.cse27 (= |g_#in~pointer.offset| .cse26))) (let ((.cse30 (and .cse25 .cse32 .cse28 .cse27 .cse14))) (or (not .cse27) .cse1 (and .cse8 (= g_~pointer.base .cse4) .cse9) (not .cse28) .cse5 (and .cse17 .cse14) (and .cse29 .cse24 .cse9) .cse10 (and .cse24 .cse30) .cse19 .cse12 (and (= |g_#in~pointer.offset| (select .cse31 (bvadd .cse21 |~#pp~0.offset| (_ bv4294967292 32)))) .cse30 .cse9) .cse15 (not (= |g_#in~pointer.base| (_ bv0 32)))))) (let ((.cse33 (or .cse13 (let ((.cse35 (bvadd .cse21 |~#pp~0.offset| (_ bv4 32)))) (and (= (select .cse31 .cse35) g_~pointer.offset) (= g_~pointer.base (select .cse36 .cse35)))) .cse37))) (or (not (= (bvadd .cse26 (_ bv1 32)) |g_#in~pointer.offset|)) .cse18 (and .cse11 (or .cse33 .cse29) .cse24) .cse12 (and .cse33 .cse8 .cse24 .cse9) .cse5 .cse15 (not (= (_ bv2 32) .cse34)) .cse22))))))) [2018-11-10 03:27:51,131 INFO L425 ceAbstractionStarter]: For program point L36-5(lines 34 43) no Hoare annotation was computed. [2018-11-10 03:27:51,131 INFO L425 ceAbstractionStarter]: For program point gEXIT(lines 34 43) no Hoare annotation was computed. [2018-11-10 03:27:51,131 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-10 03:27:51,131 INFO L425 ceAbstractionStarter]: For program point L39-1(line 39) no Hoare annotation was computed. [2018-11-10 03:27:51,131 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-10 03:27:51,131 INFO L421 ceAbstractionStarter]: At program point gENTRY(lines 34 43) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse7 (bvadd |~#pstate~0.offset| (_ bv4 32))) (.cse0 (select .cse12 |~#pp~0.offset|)) (.cse4 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse5 (select .cse4 |~#pstate~0.offset|)) (.cse6 (not (= (bvadd .cse0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse8 (= (bvadd ~counter~0 (_ bv1 32)) (_ bv0 32))) (.cse9 (not (= .cse0 (_ bv0 32)))) (.cse10 (= .cse0 ~counter~0)) (.cse11 (= |old(#memory_int)| |#memory_int|)) (.cse1 (not (= (_ bv1 32) (select .cse4 .cse7)))) (.cse2 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse3 (not (= (_ bv0 32) |~#pp~0.offset|)))) (and (or (not (= (bvadd .cse0 (_ bv1 32)) |g_#in~pointer.offset|)) .cse1 .cse2 .cse3 (= (store |old(#memory_int)| |~#pstate~0.base| (store .cse4 |~#pstate~0.offset| (_ bv2 32))) |#memory_int|) (not (= (_ bv2 32) .cse5)) .cse6) (or .cse1 (not (= (_ bv1 32) .cse5)) .cse2 .cse3 (= (store |old(#memory_int)| |~#pstate~0.base| (store .cse4 .cse7 (_ bv1 32))) |#memory_int|)) (or (and (or .cse8 .cse9 .cse10 .cse2) (or .cse8 .cse2 .cse6)) .cse11 (forall ((g_~i~2 (_ BitVec 32))) (or (not (= (_ bv1 32) (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (bvadd (bvmul (_ bv4 32) g_~i~2) |~#pp~0.offset| (_ bv4294967292 32))))) (bvslt g_~i~2 (_ bv2 32)) (not (bvslt (bvadd g_~i~2 (_ bv4294967295 32)) (_ bv2 32))))) .cse3 (not (= (_ bv2 32) |g_#in~pointer.offset|))) (let ((.cse14 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse13 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or .cse8 .cse9 (not (= (_ bv1 32) |g_#in~pointer.offset|)) (not (= (_ bv1 32) (select .cse12 .cse13))) .cse10 .cse11 (or .cse1 (= (select .cse14 |~#pp~0.offset|) (_ bv0 32)) .cse2) .cse3 (not (= (select .cse14 .cse13) (_ bv0 32))))))))) [2018-11-10 03:27:51,131 INFO L425 ceAbstractionStarter]: For program point L37-1(lines 37 41) no Hoare annotation was computed. [2018-11-10 03:27:51,131 INFO L421 ceAbstractionStarter]: At program point L39-3(line 39) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse10 (select .cse6 |~#pp~0.offset|)) (.cse12 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse0 (not (= (_ bv1 32) (select .cse12 (bvadd |~#pstate~0.offset| (_ bv4 32)))))) (.cse1 (select .cse12 |~#pstate~0.offset|)) (.cse5 (not (= .cse10 (_ bv0 32)))) (.cse8 (= .cse10 ~counter~0)) (.cse4 (= (bvadd ~counter~0 (_ bv1 32)) (_ bv0 32))) (.cse2 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse11 (not (= (bvadd .cse10 (_ bv4294967295 32)) (_ bv0 32)))) (.cse3 (not (= (_ bv0 32) |~#pp~0.offset|)))) (and (or .cse0 (not (= (_ bv1 32) .cse1)) .cse2 .cse3) (let ((.cse9 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse7 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or .cse4 .cse5 (not (= (_ bv1 32) |g_#in~pointer.offset|)) (not (= (_ bv1 32) (select .cse6 .cse7))) .cse8 (or .cse0 (= (select .cse9 |~#pp~0.offset|) (_ bv0 32)) .cse2) .cse3 (not (= (select .cse9 .cse7) (_ bv0 32))))) (or (not (= (bvadd .cse10 (_ bv1 32)) |g_#in~pointer.offset|)) .cse0 .cse2 .cse3 (not (= (_ bv2 32) .cse1)) .cse11) (or (and (or .cse4 .cse5 .cse8 .cse2) (or .cse4 .cse2 .cse11)) (forall ((g_~i~2 (_ BitVec 32))) (or (not (= (_ bv1 32) (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (bvadd (bvmul (_ bv4 32) g_~i~2) |~#pp~0.offset| (_ bv4294967292 32))))) (bvslt g_~i~2 (_ bv2 32)) (not (bvslt (bvadd g_~i~2 (_ bv4294967295 32)) (_ bv2 32))))) .cse3 (not (= (_ bv2 32) |g_#in~pointer.offset|))))))) [2018-11-10 03:27:51,131 INFO L425 ceAbstractionStarter]: For program point L39-4(line 39) no Hoare annotation was computed. [2018-11-10 03:27:51,132 INFO L425 ceAbstractionStarter]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-10 03:27:51,132 INFO L425 ceAbstractionStarter]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2018-11-10 03:27:51,132 INFO L425 ceAbstractionStarter]: For program point __blast_assertFINAL(lines 4 7) no Hoare annotation was computed. [2018-11-10 03:27:51,132 INFO L428 ceAbstractionStarter]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2018-11-10 03:27:51,132 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:27:51,132 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |~#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)) (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse1) (_ bv0 32)))) [2018-11-10 03:27:51,132 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 03:27:51,132 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 03:27:51,132 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-10 03:27:51,132 INFO L421 ceAbstractionStarter]: At program point L62(line 62) the Hoare annotation is: (let ((.cse7 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse10 (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) |~#pp~0.offset|)) (.cse11 (select |#memory_int| |~#pstate~0.base|))) (let ((.cse2 (= (bvadd (select .cse11 (bvadd |~#pstate~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (.cse5 (select .cse11 |~#pstate~0.offset|)) (.cse3 (= (_ bv1 32) .cse10)) (.cse1 (not (= main_~a~0.offset ~counter~0))) (.cse6 (= (_ bv0 32) main_~a~0.base)) (.cse0 (select .cse7 |~#pp~0.offset|)) (.cse4 (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32))) (.cse8 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (not (= .cse0 (_ bv0 32))) (and .cse1 .cse2 (= (bvadd main_~a~0.offset (_ bv1 32)) main_~b~0.offset) .cse3 .cse4 (= (_ bv2 32) .cse5) .cse6) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (and .cse2 .cse4 (= (_ bv1 32) .cse5) .cse6) (not (= (_ bv0 32) (select .cse7 .cse8))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (and (let ((.cse9 (not (= (_ bv4294967295 32) ~counter~0)))) (or (and .cse1 .cse9 .cse3 .cse6) (and .cse1 .cse9 (not (= ~counter~0 .cse10)) .cse6 (= .cse10 .cse0)))) (exists ((g_~i~2 (_ BitVec 32))) (and (bvslt (bvadd g_~i~2 (_ bv4294967295 32)) (_ bv2 32)) (not (bvslt g_~i~2 (_ bv2 32))) (= (bvadd (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) (bvadd (bvmul (_ bv4 32) g_~i~2) |~#pp~0.offset| (_ bv4294967292 32))) (_ bv4294967295 32)) (_ bv0 32)))) (= (bvadd main_~b~0.offset (_ bv4294967294 32)) (_ bv0 32)) .cse4) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) .cse8) (_ bv0 32)))))) [2018-11-10 03:27:51,132 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 51 69) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (not (= (select .cse0 |~#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 .cse0 .cse1))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) .cse1) (_ bv0 32))))) [2018-11-10 03:27:51,132 INFO L421 ceAbstractionStarter]: At program point L61(line 61) the Hoare annotation is: (let ((.cse11 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse7 (select |#memory_int| |~#pstate~0.base|)) (.cse9 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse1 (not (= main_~a~0.offset ~counter~0))) (.cse3 (not (= (_ bv4294967295 32) ~counter~0))) (.cse6 (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32))) (.cse5 (select .cse9 |~#pp~0.offset|)) (.cse2 (= (bvadd (select .cse7 (bvadd |~#pstate~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (.cse4 (select .cse11 |~#pp~0.offset|)) (.cse8 (= (_ bv0 32) main_~a~0.base)) (.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse10 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (and .cse1 .cse2 .cse3 (= main_~a~0.base .cse4) (= (bvadd main_~b~0.offset (_ bv4294967294 32)) (_ bv0 32)) (= main_~a~0.offset .cse5) .cse6 (= (_ bv1 32) (select .cse7 |~#pstate~0.offset|)) .cse8) (and .cse1 (= main_~a~0.offset (select .cse9 .cse10)) .cse3 .cse6 (not (= ~counter~0 .cse5)) (= (_ bv0 32) .cse5) .cse2 (= (bvadd main_~a~0.offset (_ bv1 32)) main_~b~0.offset) (= (select .cse11 .cse10) main_~a~0.base) (not (= (_ bv0 32) .cse4)) .cse8) (not (= (_ bv0 32) (select .cse0 .cse10))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) .cse10) (_ bv0 32)))))) [2018-11-10 03:27:51,133 INFO L421 ceAbstractionStarter]: At program point L60(line 60) the Hoare annotation is: (let ((.cse4 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse0 (select .cse4 |~#pp~0.offset|)) (.cse2 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (not (= .cse0 (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (and (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse3 (select .cse1 |~#pp~0.offset|))) (and (not (= main_~a~0.offset ~counter~0)) (not (= (_ bv4294967295 32) ~counter~0)) (= (_ bv0 32) (select .cse1 .cse2)) (not (= ~counter~0 .cse3)) (= .cse3 .cse0) (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse2) (_ bv0 32)) (= (_ bv0 32) main_~a~0.base)))) (= (bvadd main_~b~0.offset (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv0 32) (select .cse4 .cse2))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) .cse2) (_ bv0 32)))))) [2018-11-10 03:27:51,133 INFO L421 ceAbstractionStarter]: At program point L60-1(line 60) the Hoare annotation is: (let ((.cse14 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse12 (bvadd |~#pp~0.offset| (_ bv4 32))) (.cse13 (select |#memory_$Pointer$.base| |~#pp~0.base|))) (let ((.cse1 (not (= main_~a~0.offset ~counter~0))) (.cse2 (not (= (_ bv4294967295 32) ~counter~0))) (.cse9 (select .cse13 |~#pp~0.offset|)) (.cse3 (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32))) (.cse11 (select .cse0 .cse12)) (.cse6 (select .cse14 .cse12)) (.cse5 (select |#memory_int| |~#pstate~0.base|)) (.cse7 (= (bvadd main_~a~0.offset (_ bv1 32)) main_~b~0.offset)) (.cse4 (select .cse14 |~#pp~0.offset|)) (.cse8 (select .cse13 .cse12)) (.cse10 (= (_ bv0 32) main_~a~0.base))) (or (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (and .cse1 .cse2 .cse3 (not (= ~counter~0 .cse4)) (= (_ bv0 32) .cse4) (= (bvadd (select .cse5 (bvadd |~#pstate~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) .cse6) .cse7 (= .cse8 main_~a~0.base) (not (= (_ bv0 32) .cse9)) .cse10) (not (= (_ bv0 32) .cse11)) (not (= (_ bv0 32) |~#pstate~0.offset|)) (and .cse1 .cse2 (= main_~a~0.base .cse9) .cse3 (= .cse11 .cse6) (= (_ bv1 32) (select .cse5 |~#pstate~0.offset|)) .cse7 (= (_ bv1 32) .cse4) (= .cse8 (_ bv0 32)) .cse10) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) .cse12) (_ bv0 32)))))) [2018-11-10 03:27:51,133 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 58) no Hoare annotation was computed. [2018-11-10 03:27:51,133 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 51 69) no Hoare annotation was computed. [2018-11-10 03:27:51,133 INFO L421 ceAbstractionStarter]: At program point L56(line 56) the Hoare annotation is: (let ((.cse3 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse2 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse1 (select .cse3 .cse2))) (or (and (= (bvadd ~counter~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32)) (let ((.cse0 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (_ bv0 32) (select .cse0 |~#pp~0.offset|)) (= .cse1 (select .cse0 .cse2)))) (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse2) (_ bv0 32)) (= (_ bv0 32) main_~a~0.base)) (not (= (select .cse3 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv0 32) .cse1)) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) .cse2) (_ bv0 32)))))) [2018-11-10 03:27:51,133 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-10 03:27:51,133 INFO L425 ceAbstractionStarter]: For program point L56-1(line 56) no Hoare annotation was computed. [2018-11-10 03:27:51,133 INFO L421 ceAbstractionStarter]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (not (= (select .cse0 |~#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 .cse0 .cse1))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) .cse1) (_ bv0 32))))) [2018-11-10 03:27:51,133 INFO L421 ceAbstractionStarter]: At program point L54-1(line 54) the Hoare annotation is: (let ((.cse3 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse0 (select .cse3 |~#pp~0.offset|)) (.cse2 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (not (= .cse0 (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (and (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (_ bv0 32) (select .cse1 .cse2)) (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse2) (_ bv0 32)) (= (select .cse1 |~#pp~0.offset|) .cse0))) (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv0 32) (select .cse3 .cse2))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) .cse2) (_ bv0 32)))))) [2018-11-10 03:27:51,133 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 51 69) no Hoare annotation was computed. [2018-11-10 03:27:51,140 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,140 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,140 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,140 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,141 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,141 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,141 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,141 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,141 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,141 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,142 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,142 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,142 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,142 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,143 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,143 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,143 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,143 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,143 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,144 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,144 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,144 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,144 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,144 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,145 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,145 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,145 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,145 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,145 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,146 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,146 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,146 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,146 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,146 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,146 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,146 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,147 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,147 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,147 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,147 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,147 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,148 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,148 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,148 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,149 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,149 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,149 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,149 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,149 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,149 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,149 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,149 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,149 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,150 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,150 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,150 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,150 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,150 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,150 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,150 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,150 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,151 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,151 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,151 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,151 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,151 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,151 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,151 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,151 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,152 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,152 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,152 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,152 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,152 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,152 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,153 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,153 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,153 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,153 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,153 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,153 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,153 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,153 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,153 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,153 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,154 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,154 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,154 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,154 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,154 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,154 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,154 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,154 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,154 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,154 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,155 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,155 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,155 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,158 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,158 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,159 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,159 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,161 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,161 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,162 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,162 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,162 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,162 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,162 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,163 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,163 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,163 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,166 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,166 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,166 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,166 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,166 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,167 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,167 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,167 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,167 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,167 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,168 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,168 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,168 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,168 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,168 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,169 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,169 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,169 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,169 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,169 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,169 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,170 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,170 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,170 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,170 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,170 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,171 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,171 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,171 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,171 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,171 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,172 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,172 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,172 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,172 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,172 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,172 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,174 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,174 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,174 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,174 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,174 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,175 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,175 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,175 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,175 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,175 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,176 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,176 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,176 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,176 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,176 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,176 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,177 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,177 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,177 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,177 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,177 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,177 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,178 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,178 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,178 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,178 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,178 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,178 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,179 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,179 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,179 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,179 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,179 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,180 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,180 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,180 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,180 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,180 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,180 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,180 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,181 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,184 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,184 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,185 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,185 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,185 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,185 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,187 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,187 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,188 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,188 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,188 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,189 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,189 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[g_~i~2,QUANTIFIED] [2018-11-10 03:27:51,189 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[g_~i~2,QUANTIFIED] [2018-11-10 03:27:51,189 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[g_~i~2,QUANTIFIED] [2018-11-10 03:27:51,189 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,190 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,190 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,190 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,191 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,191 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,191 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,194 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,195 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,195 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,195 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,195 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,195 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,196 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,196 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,196 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,196 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,197 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,197 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,197 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,197 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,197 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,197 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,198 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,198 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,198 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,198 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,198 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,198 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,198 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,198 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,198 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,199 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,199 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,199 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,199 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,199 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,199 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,199 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,199 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,200 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,200 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,200 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,200 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,200 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,200 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,201 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,201 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,201 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,201 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,201 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,201 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,201 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,201 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,201 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,202 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,202 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,202 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,202 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,202 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,202 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,202 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,203 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,203 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,203 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,203 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,203 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,204 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,204 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,204 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,204 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,204 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,204 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,204 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,205 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,205 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,205 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,205 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,205 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,205 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,205 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,205 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,205 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,205 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,206 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,206 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,206 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,206 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,206 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,206 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,206 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,206 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,207 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,207 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,207 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,207 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,207 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,208 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,208 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,208 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,208 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,208 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,209 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,209 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,209 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,209 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,209 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,209 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,210 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,211 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,211 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,211 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,211 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,212 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,212 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,212 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,212 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,212 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,213 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,213 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,213 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,213 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[g_~i~2,QUANTIFIED] [2018-11-10 03:27:51,214 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[g_~i~2,QUANTIFIED] [2018-11-10 03:27:51,214 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[g_~i~2,QUANTIFIED] [2018-11-10 03:27:51,214 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,214 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,214 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,215 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,215 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,215 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,219 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,219 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,219 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,219 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,219 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,220 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,220 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,220 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,220 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,220 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,221 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,221 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,221 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,221 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,221 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,221 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,222 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,222 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,222 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,222 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,222 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,223 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,223 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,223 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,223 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,223 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,226 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,226 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,226 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,226 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,226 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,226 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,227 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,227 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,227 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,227 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,227 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,227 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,227 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,228 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,228 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,228 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,228 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,228 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,228 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,229 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,229 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,229 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,229 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,229 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,230 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,230 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,230 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,230 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,230 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,230 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,231 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,231 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,231 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,231 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,231 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,231 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,231 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,232 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,232 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,232 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,232 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,232 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,232 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,233 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,233 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,233 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,233 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,233 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,233 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,234 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,234 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,234 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,234 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,234 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,234 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,235 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,235 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,235 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,235 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,235 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,235 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,235 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,236 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,236 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,236 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,237 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,237 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,237 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,237 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,237 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,237 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,238 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,238 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,238 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,238 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,238 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,238 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,239 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,239 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,239 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,239 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,239 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,239 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,240 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,240 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,240 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,240 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,240 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,240 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,241 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,241 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,241 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,241 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:27:51 BoogieIcfgContainer [2018-11-10 03:27:51,242 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 03:27:51,243 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:27:51,243 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:27:51,243 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:27:51,243 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:26:37" (3/4) ... [2018-11-10 03:27:51,246 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 03:27:51,250 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init [2018-11-10 03:27:51,250 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure malloc [2018-11-10 03:27:51,250 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 03:27:51,250 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2018-11-10 03:27:51,250 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2018-11-10 03:27:51,251 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __blast_assert [2018-11-10 03:27:51,251 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 03:27:51,254 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2018-11-10 03:27:51,254 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-10 03:27:51,255 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 03:27:51,271 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(\old(#memory_$Pointer$)[pp][pp] == 0bv32) || !(~bvadd64(counter, 4294967295bv32) == 0bv32)) || ((0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)] && #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)] == 0bv32) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp])) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32) [2018-11-10 03:27:51,271 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((~bvadd64(counter, 1bv32) == 0bv32 || (((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0bv32)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || (((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && ~bvadd64(i, 4294967295bv32) == 0bv32) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(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(#memory_$Pointer$)[pp][pp] == 0bv32) || !(1bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || \old(#memory_$Pointer$)[pp][pp] == counter) || !(0bv32 == pstate)) || ~bvadd64(counter, 1bv32) == 0bv32) || (((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0bv32)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || (((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && 2bv32 == i) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || \old(#memory_$Pointer$)[pp][pp] == 0bv32) || !(0bv32 == pp)) || (((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && ~bvadd64(i, 4294967295bv32) == 0bv32) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32))) && ((((((((~bvadd64(counter, 1bv32) == 0bv32 || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || ((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && ~bvadd64(i, 4294967295bv32) == 0bv32) && \old(#memory_$Pointer$) == #memory_$Pointer$) && !(0bv32 == #memory_$Pointer$[pp][pp]))) || \old(#memory_$Pointer$)[pp][pp] == counter) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || (((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0bv32)) || !(0bv32 == pp)) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) [2018-11-10 03:27:51,271 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(#memory_$Pointer$[pp][pp] == 0bv32) || !(1bv32 == pointer)) || !(1bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || #memory_$Pointer$[pp][pp] == counter) || #memory_$Pointer$[pp][pp] == 0bv32 || !(0bv32 == pstate)) || (((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && i == 0bv32) && pointer == pointer)) || ~bvadd64(counter, 1bv32) == 0bv32) || (((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && ~bvadd64(i, 4294967295bv32) == 0bv32) && pointer == pointer)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || ((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && !(pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) && 2bv32 == i)) || !(0bv32 == pp)) || (2bv32 == i && pointer == pointer)) || !(#memory_$Pointer$[pp][~bvadd64(pp, 4bv32)] == 0bv32)) && (((((((i == 0bv32 && \old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32) := 1bv32]] == unknown-#memory_int-unknown) || (pstate == 0bv32 && 2bv32 == i)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || (~bvadd64(i, 4294967295bv32) == 0bv32 && ~bvadd64(unknown-#memory_int-unknown[pstate][~bvadd64(~bvmul32(4bv32, i), pstate)], 4294967295bv32) == 0bv32)) || !(0bv32 == pstate)) || !(0bv32 == pp))) && ((((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && i == 0bv32) && pointer == pointer) || ((((~bvadd64(counter, 1bv32) == 0bv32 || !(#memory_$Pointer$[pp][pp] == 0bv32)) || #memory_$Pointer$[pp][pp] == counter) || !(0bv32 == pstate)) && ((~bvadd64(counter, 1bv32) == 0bv32 || !(0bv32 == pstate)) || !(~bvadd64(#memory_$Pointer$[pp][pp], 4294967295bv32) == 0bv32)))) || (pstate == 0bv32 && 2bv32 == i)) || (((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && ((pstate == 0bv32 && ~bvadd64(i, 4294967295bv32) == 0bv32) || (i == 0bv32 && ((pstate == 0bv32 && (counter == 0bv32 || !(counter == #memory_$Pointer$[pp][pp]))) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && 1bv32 == unknown-#memory_int-unknown[pstate][~bvadd64(~bvmul32(4bv32, i), pstate, 4bv32)]))) || (((pstate == 0bv32 && ~bvadd64(i, 4294967295bv32) == 0bv32) || (i == 0bv32 && ((pstate == 0bv32 && (counter == 0bv32 || !(counter == #memory_$Pointer$[pp][pp]))) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && 1bv32 == unknown-#memory_int-unknown[pstate][~bvadd64(~bvmul32(4bv32, i), pstate, 4bv32)])) && \old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][pstate := 2bv32]] == unknown-#memory_int-unknown)) && pointer == pointer)) || (forall g_~i~2 : bv32 :: (!(1bv32 == #memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, g_~i~2), pp, 4294967292bv32)]) || ~bvslt32(g_~i~2, 2bv32)) || !~bvslt32(~bvadd64(g_~i~2, 4294967295bv32), 2bv32))) || !(0bv32 == pp)) || !(2bv32 == pointer))) && (((((((((((((!(pointer == #memory_$Pointer$[pp][pp]) || !(1bv32 == pointer)) || ((i == 0bv32 && pointer == #memory_$Pointer$[pp][pp]) && pointer == pointer)) || !(pointer == #memory_$Pointer$[pp][pp])) || !(0bv32 == pstate)) || (\old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32) := 1bv32]] == unknown-#memory_int-unknown && 2bv32 == i)) || (((((#memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp)] == pointer && pointer == #memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp)]) || !(pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || !(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 == pointer)) || ~bvadd64(counter, 1bv32) == 0bv32) || (\old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][pstate := 2bv32]] == unknown-#memory_int-unknown && (((pstate == 0bv32 && 1bv32 == pointer) && pointer == #memory_$Pointer$[pp][pp]) && pointer == #memory_$Pointer$[pp][pp]) && 2bv32 == i)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || ((pointer == #memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp, 4294967292bv32)] && (((pstate == 0bv32 && 1bv32 == pointer) && pointer == #memory_$Pointer$[pp][pp]) && pointer == #memory_$Pointer$[pp][pp]) && 2bv32 == i) && pointer == pointer)) || !(0bv32 == pp)) || !(pointer == 0bv32))) && ((((((((!(~bvadd64(#memory_$Pointer$[pp][pp], 1bv32) == pointer) || (pstate == 0bv32 && 2bv32 == i)) || ((~bvadd64(i, 4294967295bv32) == 0bv32 && (((!(pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || (#memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp, 4bv32)] == pointer && pointer == #memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp, 4bv32)])) || !(pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || ((#memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp)] == pointer && pointer == #memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp)]) || !(pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || !(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)])) || (((((!(pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || (#memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp, 4bv32)] == pointer && pointer == #memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp, 4bv32)])) || !(pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) && i == 0bv32) && \old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][pstate := 2bv32]] == unknown-#memory_int-unknown) && pointer == pointer)) || !(0bv32 == pstate)) || !(0bv32 == pp)) || !(2bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(~bvadd64(#memory_$Pointer$[pp][pp], 4294967295bv32) == 0bv32)) [2018-11-10 03:27:51,280 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6032d4c3-32e9-458d-9260-110a559c1e03/bin-2019/uautomizer/witness.graphml [2018-11-10 03:27:51,280 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:27:51,281 INFO L168 Benchmark]: Toolchain (without parser) took 73967.75 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 381.2 MB). Free memory was 950.6 MB in the beginning and 847.6 MB in the end (delta: 103.0 MB). Peak memory consumption was 484.1 MB. Max. memory is 11.5 GB. [2018-11-10 03:27:51,281 INFO L168 Benchmark]: CDTParser took 0.15 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-10 03:27:51,281 INFO L168 Benchmark]: CACSL2BoogieTranslator took 193.10 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 934.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 03:27:51,281 INFO L168 Benchmark]: Boogie Preprocessor took 28.30 ms. Allocated memory is still 1.0 GB. Free memory is still 934.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:27:51,282 INFO L168 Benchmark]: RCFGBuilder took 316.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.3 MB). Free memory was 934.4 MB in the beginning and 1.2 GB in the end (delta: -217.0 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2018-11-10 03:27:51,282 INFO L168 Benchmark]: TraceAbstraction took 73389.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 202.9 MB). Free memory was 1.2 GB in the beginning and 853.1 MB in the end (delta: 298.4 MB). Peak memory consumption was 517.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:27:51,282 INFO L168 Benchmark]: Witness Printer took 37.58 ms. Allocated memory is still 1.4 GB. Free memory was 853.1 MB in the beginning and 847.6 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. [2018-11-10 03:27:51,283 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.15 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 193.10 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 934.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.30 ms. Allocated memory is still 1.0 GB. Free memory is still 934.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 316.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.3 MB). Free memory was 934.4 MB in the beginning and 1.2 GB in the end (delta: -217.0 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 73389.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 202.9 MB). Free memory was 1.2 GB in the beginning and 853.1 MB in the end (delta: 298.4 MB). Peak memory consumption was 517.8 MB. Max. memory is 11.5 GB. * Witness Printer took 37.58 ms. Allocated memory is still 1.4 GB. Free memory was 853.1 MB in the beginning and 847.6 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[g_~i~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[g_~i~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[g_~i~2,QUANTIFIED] - 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$.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$.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$.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$.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$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[g_~i~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[g_~i~2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[g_~i~2,QUANTIFIED] - 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$.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$.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$.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$.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$.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$.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_$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_$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_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_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_$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_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_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_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_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_$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_$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_$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_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_$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_$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_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_$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_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_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_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_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_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_$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_$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_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_$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_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_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$ * 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-10 03:27:51,293 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,293 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,293 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,293 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,293 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,293 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,293 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,294 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,294 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,294 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,294 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,294 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,294 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,294 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,294 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,308 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,309 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,309 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,314 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,315 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,315 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,315 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,315 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,315 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,315 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,315 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,315 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,316 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,316 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,316 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,316 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,316 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,316 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,316 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,328 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,328 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,328 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,328 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,328 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,328 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,328 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,347 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,347 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,347 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,347 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,347 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,350 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,350 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,350 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,350 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,350 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,350 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,350 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,350 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,350 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,351 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,351 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,352 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,352 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,367 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,367 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,367 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,367 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,367 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,367 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,367 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,368 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,368 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,368 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,368 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,368 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,368 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,368 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,369 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,369 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,369 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,369 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,369 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,385 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,385 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,385 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,385 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,387 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,404 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,404 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,404 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,405 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,405 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,405 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,405 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,405 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,405 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,405 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,406 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,406 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,406 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,406 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,406 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,406 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,406 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,406 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,407 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,407 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,407 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,407 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,407 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,407 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,407 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,408 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,408 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,408 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,408 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,408 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,408 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,408 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,408 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,408 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,409 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,409 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,409 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,409 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,409 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,409 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,424 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,424 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,425 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,425 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,425 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,425 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,425 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,425 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,425 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,425 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,426 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,426 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,426 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,426 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,426 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,426 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((~bvadd64(counter, 1bv32) == 0bv32 || (((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0bv32)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || (((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && ~bvadd64(i, 4294967295bv32) == 0bv32) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(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(#memory_$Pointer$)[pp][pp] == 0bv32) || !(1bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || \old(#memory_$Pointer$)[pp][pp] == counter) || !(0bv32 == pstate)) || ~bvadd64(counter, 1bv32) == 0bv32) || (((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0bv32)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || (((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && 2bv32 == i) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || \old(#memory_$Pointer$)[pp][pp] == 0bv32) || !(0bv32 == pp)) || (((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && ~bvadd64(i, 4294967295bv32) == 0bv32) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32))) && ((((((((~bvadd64(counter, 1bv32) == 0bv32 || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || ((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && ~bvadd64(i, 4294967295bv32) == 0bv32) && \old(#memory_$Pointer$) == #memory_$Pointer$) && !(0bv32 == #memory_$Pointer$[pp][pp]))) || \old(#memory_$Pointer$)[pp][pp] == counter) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || (((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0bv32)) || !(0bv32 == pp)) || !(\old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == 0bv32)) - InvariantResult [Line: 36]: Loop Invariant [2018-11-10 03:27:51,444 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,444 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,444 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,444 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,445 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,445 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,467 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,467 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,467 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,468 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,468 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,468 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,468 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[g_~i~2,QUANTIFIED] [2018-11-10 03:27:51,468 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[g_~i~2,QUANTIFIED] [2018-11-10 03:27:51,468 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[g_~i~2,QUANTIFIED] [2018-11-10 03:27:51,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,469 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,470 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,470 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,470 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,504 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,505 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,505 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,505 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,505 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,505 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,505 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,505 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,506 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,506 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,506 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,506 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,506 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,506 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,507 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,507 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,507 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,507 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,507 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,507 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,508 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,541 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,541 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,541 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,541 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,542 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,542 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,542 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,542 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,542 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,542 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,542 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,542 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,543 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,543 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,543 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,543 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,543 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,543 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,543 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,544 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,544 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,544 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,544 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,544 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,544 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,544 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,545 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,545 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,545 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,545 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,545 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,545 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,545 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,545 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,546 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,546 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,546 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,546 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,546 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,546 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,547 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,582 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,582 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,582 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,582 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,582 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,582 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,582 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,582 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,583 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,583 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,583 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,583 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,583 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,583 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,583 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,583 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,584 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,584 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,616 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,616 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,616 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,616 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,617 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,617 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,617 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,617 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,617 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,617 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,618 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[g_~i~2,QUANTIFIED] [2018-11-10 03:27:51,618 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[g_~i~2,QUANTIFIED] [2018-11-10 03:27:51,618 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[g_~i~2,QUANTIFIED] [2018-11-10 03:27:51,618 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,618 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,618 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,618 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,619 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,619 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,653 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,653 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,654 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,654 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,654 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,654 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,654 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,654 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,654 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,655 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,655 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,655 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,655 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,655 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,655 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,656 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,656 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,656 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,656 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,694 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,694 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,694 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,694 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,695 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,695 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,695 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,695 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,695 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,695 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,695 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,696 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,696 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,696 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,696 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,696 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,696 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,696 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,696 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,697 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,697 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,697 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,697 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,697 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,697 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,697 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,697 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,698 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,698 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,698 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,698 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,698 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,698 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,698 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,699 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,699 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,699 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,699 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,699 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,711 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,711 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,712 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,712 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,712 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,712 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,712 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,712 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,712 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,713 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,713 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,713 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,713 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,713 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,713 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,713 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,714 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,714 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,714 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,714 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,714 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,714 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,714 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,714 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,715 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,715 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,715 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,715 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,715 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,715 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,715 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,716 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,716 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,716 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,716 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,716 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,716 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,716 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,717 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,717 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,723 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,723 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,723 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,723 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 03:27:51,723 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((((((!(#memory_$Pointer$[pp][pp] == 0bv32) || !(1bv32 == pointer)) || !(1bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || #memory_$Pointer$[pp][pp] == counter) || #memory_$Pointer$[pp][pp] == 0bv32 || !(0bv32 == pstate)) || (((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && i == 0bv32) && pointer == pointer)) || ~bvadd64(counter, 1bv32) == 0bv32) || (((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && ~bvadd64(i, 4294967295bv32) == 0bv32) && pointer == pointer)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || ((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && !(pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) && 2bv32 == i)) || !(0bv32 == pp)) || (2bv32 == i && pointer == pointer)) || !(#memory_$Pointer$[pp][~bvadd64(pp, 4bv32)] == 0bv32)) && (((((((i == 0bv32 && \old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32) := 1bv32]] == unknown-#memory_int-unknown) || (pstate == 0bv32 && 2bv32 == i)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || (~bvadd64(i, 4294967295bv32) == 0bv32 && ~bvadd64(unknown-#memory_int-unknown[pstate][~bvadd64(~bvmul32(4bv32, i), pstate)], 4294967295bv32) == 0bv32)) || !(0bv32 == pstate)) || !(0bv32 == pp))) && ((((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && i == 0bv32) && pointer == pointer) || ((((~bvadd64(counter, 1bv32) == 0bv32 || !(#memory_$Pointer$[pp][pp] == 0bv32)) || #memory_$Pointer$[pp][pp] == counter) || !(0bv32 == pstate)) && ((~bvadd64(counter, 1bv32) == 0bv32 || !(0bv32 == pstate)) || !(~bvadd64(#memory_$Pointer$[pp][pp], 4294967295bv32) == 0bv32)))) || (pstate == 0bv32 && 2bv32 == i)) || (((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && ((pstate == 0bv32 && ~bvadd64(i, 4294967295bv32) == 0bv32) || (i == 0bv32 && ((pstate == 0bv32 && (counter == 0bv32 || !(counter == #memory_$Pointer$[pp][pp]))) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && 1bv32 == unknown-#memory_int-unknown[pstate][~bvadd64(~bvmul32(4bv32, i), pstate, 4bv32)]))) || (((pstate == 0bv32 && ~bvadd64(i, 4294967295bv32) == 0bv32) || (i == 0bv32 && ((pstate == 0bv32 && (counter == 0bv32 || !(counter == #memory_$Pointer$[pp][pp]))) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && 1bv32 == unknown-#memory_int-unknown[pstate][~bvadd64(~bvmul32(4bv32, i), pstate, 4bv32)])) && \old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][pstate := 2bv32]] == unknown-#memory_int-unknown)) && pointer == pointer)) || (forall g_~i~2 : bv32 :: (!(1bv32 == #memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, g_~i~2), pp, 4294967292bv32)]) || ~bvslt32(g_~i~2, 2bv32)) || !~bvslt32(~bvadd64(g_~i~2, 4294967295bv32), 2bv32))) || !(0bv32 == pp)) || !(2bv32 == pointer))) && (((((((((((((!(pointer == #memory_$Pointer$[pp][pp]) || !(1bv32 == pointer)) || ((i == 0bv32 && pointer == #memory_$Pointer$[pp][pp]) && pointer == pointer)) || !(pointer == #memory_$Pointer$[pp][pp])) || !(0bv32 == pstate)) || (\old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32) := 1bv32]] == unknown-#memory_int-unknown && 2bv32 == i)) || (((((#memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp)] == pointer && pointer == #memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp)]) || !(pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || !(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 == pointer)) || ~bvadd64(counter, 1bv32) == 0bv32) || (\old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][pstate := 2bv32]] == unknown-#memory_int-unknown && (((pstate == 0bv32 && 1bv32 == pointer) && pointer == #memory_$Pointer$[pp][pp]) && pointer == #memory_$Pointer$[pp][pp]) && 2bv32 == i)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || ((pointer == #memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp, 4294967292bv32)] && (((pstate == 0bv32 && 1bv32 == pointer) && pointer == #memory_$Pointer$[pp][pp]) && pointer == #memory_$Pointer$[pp][pp]) && 2bv32 == i) && pointer == pointer)) || !(0bv32 == pp)) || !(pointer == 0bv32))) && ((((((((!(~bvadd64(#memory_$Pointer$[pp][pp], 1bv32) == pointer) || (pstate == 0bv32 && 2bv32 == i)) || ((~bvadd64(i, 4294967295bv32) == 0bv32 && (((!(pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || (#memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp, 4bv32)] == pointer && pointer == #memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp, 4bv32)])) || !(pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || ((#memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp)] == pointer && pointer == #memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp)]) || !(pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || !(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)])) || (((((!(pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || (#memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp, 4bv32)] == pointer && pointer == #memory_$Pointer$[pp][~bvadd64(~bvmul32(4bv32, i), pp, 4bv32)])) || !(pointer == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) && i == 0bv32) && \old(unknown-#memory_int-unknown)[pstate := \old(unknown-#memory_int-unknown)[pstate][pstate := 2bv32]] == unknown-#memory_int-unknown) && pointer == pointer)) || !(0bv32 == pstate)) || !(0bv32 == pp)) || !(2bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(~bvadd64(#memory_$Pointer$[pp][pp], 4294967295bv32) == 0bv32)) - InvariantResult [Line: 17]: Loop Invariant [2018-11-10 03:27:51,757 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,758 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,758 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,758 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,758 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,758 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,758 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,758 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,758 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,759 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,759 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,759 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,759 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,759 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,759 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,759 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,759 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,760 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,760 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,760 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 03:27:51,760 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 03:27:51,760 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,760 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,760 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,760 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,768 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,768 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 03:27:51,768 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((!(\old(#memory_$Pointer$)[pp][pp] == 0bv32) || !(~bvadd64(counter, 4294967295bv32) == 0bv32)) || ((0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)] && #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)] == 0bv32) && #memory_$Pointer$[pp][pp] == \old(#memory_$Pointer$)[pp][pp])) || !(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, 66 locations, 1 error locations. SAFE Result, 73.2s OverallTime, 21 OverallIterations, 5 TraceHistogramMax, 36.7s AutomataDifference, 0.0s DeadEndRemovalTime, 10.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1377 SDtfs, 4193 SDslu, 4825 SDs, 0 SdLazy, 20179 SolverSat, 1880 SolverUnsat, 699 SolverUnknown, 0 SolverNotchecked, 18.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3707 GetRequests, 2920 SyntacticMatches, 18 SemanticMatches, 769 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11172 ImplicationChecksByTransitivity, 27.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=471occurred in iteration=14, 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.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 590 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 255 PreInvPairs, 344 NumberOfFragments, 3119 HoareAnnotationTreeSize, 255 FomulaSimplifications, 135241 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 20 FomulaSimplificationsInter, 76570 FormulaSimplificationTreeSizeReductionInter, 9.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 22.9s InterpolantComputationTime, 1857 NumberOfCodeBlocks, 1807 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3261 ConstructedInterpolants, 55 QuantifiedInterpolants, 2106576 SizeOfPredicates, 234 NumberOfNonLiveVariables, 4170 ConjunctsInSsa, 428 ConjunctsInUnsatCore, 40 InterpolantComputations, 3 PerfectInterpolantSequences, 858/1711 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...