./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/dancing.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/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 63ea7ed840682b4e196bd141458679e7836ad115 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:21:56,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:21:56,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:21:56,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:21:56,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:21:56,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:21:56,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:21:56,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:21:56,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:21:56,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:21:56,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:21:56,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:21:56,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:21:56,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:21:56,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:21:56,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:21:56,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:21:56,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:21:56,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:21:56,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:21:56,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:21:56,165 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:21:56,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:21:56,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:21:56,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:21:56,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:21:56,168 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:21:56,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:21:56,169 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:21:56,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:21:56,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:21:56,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:21:56,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:21:56,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:21:56,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:21:56,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:21:56,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:21:56,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:21:56,172 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:21:56,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:21:56,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:21:56,173 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:21:56,184 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:21:56,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:21:56,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:21:56,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:21:56,186 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:21:56,186 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:21:56,186 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:21:56,186 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:21:56,186 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:21:56,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:21:56,187 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:21:56,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:21:56,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:21:56,187 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:21:56,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:21:56,188 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:21:56,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:21:56,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:21:56,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:21:56,189 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:21:56,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:21:56,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:21:56,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:21:56,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:21:56,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:21:56,190 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:21:56,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:21:56,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:21:56,190 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:21:56,190 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/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 -> 63ea7ed840682b4e196bd141458679e7836ad115 [2019-12-07 17:21:56,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:21:56,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:21:56,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:21:56,301 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:21:56,301 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:21:56,301 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/../../sv-benchmarks/c/heap-manipulation/dancing.i [2019-12-07 17:21:56,337 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/data/e77f067a6/c7e30052c7b9411b90e19e080ed4f0db/FLAG46f95afb7 [2019-12-07 17:21:56,675 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:21:56,675 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/sv-benchmarks/c/heap-manipulation/dancing.i [2019-12-07 17:21:56,684 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/data/e77f067a6/c7e30052c7b9411b90e19e080ed4f0db/FLAG46f95afb7 [2019-12-07 17:21:56,692 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/data/e77f067a6/c7e30052c7b9411b90e19e080ed4f0db [2019-12-07 17:21:56,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:21:56,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:21:56,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:21:56,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:21:56,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:21:56,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:21:56" (1/1) ... [2019-12-07 17:21:56,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5013f8c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:21:56, skipping insertion in model container [2019-12-07 17:21:56,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:21:56" (1/1) ... [2019-12-07 17:21:56,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:21:56,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:21:56,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:21:56,946 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:21:56,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:21:57,008 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:21:57,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:21:57 WrapperNode [2019-12-07 17:21:57,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:21:57,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:21:57,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:21:57,009 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:21:57,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:21:57" (1/1) ... [2019-12-07 17:21:57,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:21:57" (1/1) ... [2019-12-07 17:21:57,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:21:57,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:21:57,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:21:57,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:21:57,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:21:57" (1/1) ... [2019-12-07 17:21:57,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:21:57" (1/1) ... [2019-12-07 17:21:57,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:21:57" (1/1) ... [2019-12-07 17:21:57,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:21:57" (1/1) ... [2019-12-07 17:21:57,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:21:57" (1/1) ... [2019-12-07 17:21:57,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:21:57" (1/1) ... [2019-12-07 17:21:57,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:21:57" (1/1) ... [2019-12-07 17:21:57,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:21:57,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:21:57,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:21:57,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:21:57,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:21:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/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 [2019-12-07 17:21:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2019-12-07 17:21:57,106 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2019-12-07 17:21:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:21:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:21:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:21:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:21:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:21:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:21:57,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:21:57,315 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:21:57,316 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-12-07 17:21:57,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:21:57 BoogieIcfgContainer [2019-12-07 17:21:57,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:21:57,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:21:57,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:21:57,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:21:57,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:21:56" (1/3) ... [2019-12-07 17:21:57,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9a5fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:21:57, skipping insertion in model container [2019-12-07 17:21:57,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:21:57" (2/3) ... [2019-12-07 17:21:57,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9a5fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:21:57, skipping insertion in model container [2019-12-07 17:21:57,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:21:57" (3/3) ... [2019-12-07 17:21:57,322 INFO L109 eAbstractionObserver]: Analyzing ICFG dancing.i [2019-12-07 17:21:57,329 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:21:57,333 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:21:57,340 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-07 17:21:57,355 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:21:57,355 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:21:57,355 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:21:57,355 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:21:57,355 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:21:57,355 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:21:57,356 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:21:57,356 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:21:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-12-07 17:21:57,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:21:57,371 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:21:57,372 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:21:57,372 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:21:57,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:21:57,375 INFO L82 PathProgramCache]: Analyzing trace with hash -390992366, now seen corresponding path program 1 times [2019-12-07 17:21:57,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:21:57,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163862947] [2019-12-07 17:21:57,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:21:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:21:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:21:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:21:57,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163862947] [2019-12-07 17:21:57,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:21:57,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:21:57,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450813741] [2019-12-07 17:21:57,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 17:21:57,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:21:57,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 17:21:57,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 17:21:57,498 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2019-12-07 17:21:57,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:21:57,514 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2019-12-07 17:21:57,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 17:21:57,515 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-12-07 17:21:57,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:21:57,523 INFO L225 Difference]: With dead ends: 71 [2019-12-07 17:21:57,523 INFO L226 Difference]: Without dead ends: 34 [2019-12-07 17:21:57,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 17:21:57,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-07 17:21:57,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-07 17:21:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 17:21:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2019-12-07 17:21:57,554 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 17 [2019-12-07 17:21:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:21:57,555 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2019-12-07 17:21:57,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 17:21:57,555 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2019-12-07 17:21:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:21:57,556 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:21:57,556 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:21:57,556 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:21:57,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:21:57,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1529433021, now seen corresponding path program 1 times [2019-12-07 17:21:57,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:21:57,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431783987] [2019-12-07 17:21:57,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:21:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:21:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:21:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:21:57,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431783987] [2019-12-07 17:21:57,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:21:57,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:21:57,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98548858] [2019-12-07 17:21:57,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:21:57,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:21:57,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:21:57,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:21:57,625 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand 4 states. [2019-12-07 17:21:57,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:21:57,653 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-12-07 17:21:57,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:21:57,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 17:21:57,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:21:57,654 INFO L225 Difference]: With dead ends: 39 [2019-12-07 17:21:57,654 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 17:21:57,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:21:57,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 17:21:57,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-12-07 17:21:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 17:21:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2019-12-07 17:21:57,659 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 17 [2019-12-07 17:21:57,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:21:57,660 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2019-12-07 17:21:57,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:21:57,661 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2019-12-07 17:21:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:21:57,661 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:21:57,662 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:21:57,662 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:21:57,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:21:57,662 INFO L82 PathProgramCache]: Analyzing trace with hash -670941087, now seen corresponding path program 1 times [2019-12-07 17:21:57,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:21:57,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200049395] [2019-12-07 17:21:57,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:21:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:21:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:21:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:21:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 17:21:57,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200049395] [2019-12-07 17:21:57,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:21:57,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:21:57,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455028174] [2019-12-07 17:21:57,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:21:57,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:21:57,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:21:57,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:21:57,713 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand 4 states. [2019-12-07 17:21:57,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:21:57,754 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2019-12-07 17:21:57,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:21:57,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 17:21:57,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:21:57,755 INFO L225 Difference]: With dead ends: 80 [2019-12-07 17:21:57,755 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 17:21:57,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:21:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 17:21:57,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2019-12-07 17:21:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 17:21:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2019-12-07 17:21:57,762 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 23 [2019-12-07 17:21:57,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:21:57,762 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2019-12-07 17:21:57,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:21:57,762 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2019-12-07 17:21:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 17:21:57,763 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:21:57,763 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:21:57,763 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:21:57,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:21:57,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2084669319, now seen corresponding path program 1 times [2019-12-07 17:21:57,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:21:57,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776991561] [2019-12-07 17:21:57,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:21:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:21:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:21:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:21:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:21:57,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776991561] [2019-12-07 17:21:57,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288712011] [2019-12-07 17:21:57,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:21:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:21:57,867 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 17:21:57,871 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:21:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:21:57,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:21:57,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-12-07 17:21:57,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516581534] [2019-12-07 17:21:57,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:21:57,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:21:57,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:21:57,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:21:57,942 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand 12 states. [2019-12-07 17:21:58,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:21:58,151 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2019-12-07 17:21:58,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:21:58,152 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-12-07 17:21:58,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:21:58,154 INFO L225 Difference]: With dead ends: 108 [2019-12-07 17:21:58,154 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 17:21:58,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:21:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 17:21:58,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 55. [2019-12-07 17:21:58,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 17:21:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2019-12-07 17:21:58,164 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 26 [2019-12-07 17:21:58,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:21:58,164 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2019-12-07 17:21:58,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:21:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2019-12-07 17:21:58,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:21:58,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:21:58,166 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:21:58,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:21:58,367 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:21:58,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:21:58,367 INFO L82 PathProgramCache]: Analyzing trace with hash -155348295, now seen corresponding path program 1 times [2019-12-07 17:21:58,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:21:58,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17524674] [2019-12-07 17:21:58,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:21:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:21:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:21:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:21:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 17:21:58,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17524674] [2019-12-07 17:21:58,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:21:58,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:21:58,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417576319] [2019-12-07 17:21:58,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:21:58,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:21:58,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:21:58,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:21:58,495 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 5 states. [2019-12-07 17:21:58,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:21:58,543 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2019-12-07 17:21:58,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:21:58,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 17:21:58,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:21:58,546 INFO L225 Difference]: With dead ends: 59 [2019-12-07 17:21:58,546 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 17:21:58,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:21:58,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 17:21:58,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2019-12-07 17:21:58,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 17:21:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2019-12-07 17:21:58,561 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 28 [2019-12-07 17:21:58,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:21:58,562 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2019-12-07 17:21:58,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:21:58,562 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2019-12-07 17:21:58,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:21:58,564 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:21:58,565 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:21:58,565 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:21:58,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:21:58,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1907184921, now seen corresponding path program 1 times [2019-12-07 17:21:58,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:21:58,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226029542] [2019-12-07 17:21:58,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:21:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:21:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:21:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:21:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 17:21:58,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226029542] [2019-12-07 17:21:58,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492978796] [2019-12-07 17:21:58,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:21:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:21:58,662 INFO L264 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 17:21:58,663 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:21:58,753 INFO L343 Elim1Store]: treesize reduction 28, result has 60.6 percent of original size [2019-12-07 17:21:58,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 52 [2019-12-07 17:21:58,754 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:21:58,776 INFO L614 ElimStorePlain]: treesize reduction 18, result has 67.9 percent of original size [2019-12-07 17:21:58,777 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:21:58,777 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:53 [2019-12-07 17:21:58,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:21:58,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:21:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:21:58,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:21:58,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9] total 11 [2019-12-07 17:21:58,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830768716] [2019-12-07 17:21:58,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:21:58,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:21:58,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:21:58,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:21:58,955 INFO L87 Difference]: Start difference. First operand 48 states and 67 transitions. Second operand 11 states. [2019-12-07 17:22:17,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:17,473 INFO L93 Difference]: Finished difference Result 149 states and 206 transitions. [2019-12-07 17:22:17,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:22:17,474 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-12-07 17:22:17,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:17,475 INFO L225 Difference]: With dead ends: 149 [2019-12-07 17:22:17,475 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 17:22:17,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:22:17,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 17:22:17,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 85. [2019-12-07 17:22:17,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 17:22:17,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2019-12-07 17:22:17,487 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 28 [2019-12-07 17:22:17,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:17,487 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2019-12-07 17:22:17,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:22:17,488 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2019-12-07 17:22:17,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 17:22:17,489 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:17,489 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:22:17,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:17,693 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:17,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:17,694 INFO L82 PathProgramCache]: Analyzing trace with hash 333454003, now seen corresponding path program 1 times [2019-12-07 17:22:17,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:17,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781680443] [2019-12-07 17:22:17,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:22:17,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781680443] [2019-12-07 17:22:17,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:17,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:22:17,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126503949] [2019-12-07 17:22:17,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:22:17,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:17,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:22:17,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:22:17,774 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand 5 states. [2019-12-07 17:22:17,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:17,833 INFO L93 Difference]: Finished difference Result 151 states and 208 transitions. [2019-12-07 17:22:17,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:22:17,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 17:22:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:17,834 INFO L225 Difference]: With dead ends: 151 [2019-12-07 17:22:17,834 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 17:22:17,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:22:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 17:22:17,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2019-12-07 17:22:17,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 17:22:17,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2019-12-07 17:22:17,842 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 29 [2019-12-07 17:22:17,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:17,842 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2019-12-07 17:22:17,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:22:17,842 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2019-12-07 17:22:17,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:22:17,843 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:17,843 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 17:22:17,843 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:17,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:17,843 INFO L82 PathProgramCache]: Analyzing trace with hash 637156592, now seen corresponding path program 1 times [2019-12-07 17:22:17,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:17,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921051432] [2019-12-07 17:22:17,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:17,882 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 17:22:17,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921051432] [2019-12-07 17:22:17,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:17,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:22:17,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321328921] [2019-12-07 17:22:17,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:22:17,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:17,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:22:17,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:22:17,883 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand 6 states. [2019-12-07 17:22:17,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:17,926 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2019-12-07 17:22:17,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:22:17,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 17:22:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:17,928 INFO L225 Difference]: With dead ends: 77 [2019-12-07 17:22:17,928 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 17:22:17,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:22:17,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 17:22:17,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2019-12-07 17:22:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 17:22:17,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2019-12-07 17:22:17,934 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 34 [2019-12-07 17:22:17,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:17,935 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2019-12-07 17:22:17,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:22:17,935 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2019-12-07 17:22:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 17:22:17,936 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:17,936 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-12-07 17:22:17,936 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:17,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:17,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1092905979, now seen corresponding path program 1 times [2019-12-07 17:22:17,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:17,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522412494] [2019-12-07 17:22:17,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:22:18,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522412494] [2019-12-07 17:22:18,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2315128] [2019-12-07 17:22:18,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:18,169 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-07 17:22:18,171 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:22:18,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:22:18,226 INFO L343 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2019-12-07 17:22:18,227 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 60 [2019-12-07 17:22:18,227 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:22:18,254 INFO L614 ElimStorePlain]: treesize reduction 22, result has 68.6 percent of original size [2019-12-07 17:22:18,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:22:18,255 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:22:18,255 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:48 [2019-12-07 17:22:18,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:22:18,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:22:18,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:22:18,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:22:18,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:22:18,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:22:18,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:22:18,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:22:18,748 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:22:18,748 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2019-12-07 17:22:18,749 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:22:18,756 INFO L614 ElimStorePlain]: treesize reduction 14, result has 39.1 percent of original size [2019-12-07 17:22:18,756 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:22:18,756 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:4 [2019-12-07 17:22:18,784 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:22:18,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:22:18,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-12-07 17:22:18,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712114432] [2019-12-07 17:22:18,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 17:22:18,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:18,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 17:22:18,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:22:18,786 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. Second operand 20 states. [2019-12-07 17:22:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:54,745 INFO L93 Difference]: Finished difference Result 212 states and 286 transitions. [2019-12-07 17:22:54,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 17:22:54,746 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-12-07 17:22:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:54,748 INFO L225 Difference]: With dead ends: 212 [2019-12-07 17:22:54,749 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 17:22:54,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=496, Invalid=1666, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 17:22:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 17:22:54,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 53. [2019-12-07 17:22:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 17:22:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2019-12-07 17:22:54,762 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 40 [2019-12-07 17:22:54,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:54,763 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2019-12-07 17:22:54,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 17:22:54,763 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2019-12-07 17:22:54,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 17:22:54,764 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:54,764 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 17:22:54,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:54,965 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:54,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:54,966 INFO L82 PathProgramCache]: Analyzing trace with hash 774101494, now seen corresponding path program 1 times [2019-12-07 17:22:54,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:54,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007278728] [2019-12-07 17:22:54,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 17:22:55,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007278728] [2019-12-07 17:22:55,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637993994] [2019-12-07 17:22:55,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:55,078 INFO L264 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 17:22:55,080 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:22:55,083 INFO L377 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 6 treesize of output 5 [2019-12-07 17:22:55,083 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:22:55,085 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:22:55,085 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:22:55,085 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:22:55,096 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:22:55,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:22:55,096 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:22:55,097 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:22:55,097 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:22:55,098 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-12-07 17:22:55,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:22:55,108 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 17:22:55,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:22:55,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2019-12-07 17:22:55,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167144269] [2019-12-07 17:22:55,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:22:55,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:55,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:22:55,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:22:55,110 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand 11 states. [2019-12-07 17:22:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:55,248 INFO L93 Difference]: Finished difference Result 84 states and 106 transitions. [2019-12-07 17:22:55,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:22:55,248 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-12-07 17:22:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:55,249 INFO L225 Difference]: With dead ends: 84 [2019-12-07 17:22:55,249 INFO L226 Difference]: Without dead ends: 60 [2019-12-07 17:22:55,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:22:55,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-07 17:22:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-12-07 17:22:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 17:22:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2019-12-07 17:22:55,254 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 39 [2019-12-07 17:22:55,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:55,254 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2019-12-07 17:22:55,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:22:55,254 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2019-12-07 17:22:55,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 17:22:55,255 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:55,255 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-12-07 17:22:55,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:55,456 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:55,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:55,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1513117575, now seen corresponding path program 1 times [2019-12-07 17:22:55,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:55,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054935652] [2019-12-07 17:22:55,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 17:22:55,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054935652] [2019-12-07 17:22:55,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350038839] [2019-12-07 17:22:55,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:55,979 INFO L264 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 73 conjunts are in the unsatisfiable core [2019-12-07 17:22:55,981 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:22:56,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:22:56,020 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:22:56,029 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:22:56,029 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 42 [2019-12-07 17:22:56,029 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:22:56,066 INFO L614 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-12-07 17:22:56,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:22:56,071 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:22:56,078 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:22:56,078 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 42 [2019-12-07 17:22:56,079 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:22:56,108 INFO L614 ElimStorePlain]: treesize reduction 18, result has 77.2 percent of original size [2019-12-07 17:22:56,108 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:22:56,108 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:61 [2019-12-07 17:22:56,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:22:56,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:22:56,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:22:56,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:22:57,059 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_23|], 12=[|v_#memory_$Pointer$.base_25|]} [2019-12-07 17:22:57,072 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:22:57,073 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 93 [2019-12-07 17:22:57,073 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:22:57,081 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:22:57,107 INFO L343 Elim1Store]: treesize reduction 16, result has 70.9 percent of original size [2019-12-07 17:22:57,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 65 [2019-12-07 17:22:57,108 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:22:57,123 INFO L614 ElimStorePlain]: treesize reduction 4, result has 89.2 percent of original size [2019-12-07 17:22:57,123 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:22:57,123 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:33 [2019-12-07 17:22:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 17:22:57,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:22:57,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2019-12-07 17:22:57,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297697332] [2019-12-07 17:22:57,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 17:22:57,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:57,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 17:22:57,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 17:22:57,441 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand 36 states. [2019-12-07 17:22:58,442 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 81 [2019-12-07 17:22:58,610 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 72 [2019-12-07 17:22:59,009 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 79 [2019-12-07 17:22:59,163 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 66 [2019-12-07 17:22:59,363 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 86 [2019-12-07 17:22:59,576 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 77 [2019-12-07 17:23:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:02,685 INFO L93 Difference]: Finished difference Result 227 states and 297 transitions. [2019-12-07 17:23:02,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-07 17:23:02,685 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 40 [2019-12-07 17:23:02,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:02,687 INFO L225 Difference]: With dead ends: 227 [2019-12-07 17:23:02,687 INFO L226 Difference]: Without dead ends: 198 [2019-12-07 17:23:02,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=770, Invalid=6540, Unknown=0, NotChecked=0, Total=7310 [2019-12-07 17:23:02,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-12-07 17:23:02,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 128. [2019-12-07 17:23:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-07 17:23:02,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 172 transitions. [2019-12-07 17:23:02,710 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 172 transitions. Word has length 40 [2019-12-07 17:23:02,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:02,710 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 172 transitions. [2019-12-07 17:23:02,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 17:23:02,710 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 172 transitions. [2019-12-07 17:23:02,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 17:23:02,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:02,711 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-12-07 17:23:02,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:02,912 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:02,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:02,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1275496661, now seen corresponding path program 2 times [2019-12-07 17:23:02,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:02,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112637042] [2019-12-07 17:23:02,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:02,979 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 17:23:02,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112637042] [2019-12-07 17:23:02,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:23:02,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:23:02,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559476785] [2019-12-07 17:23:02,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:23:02,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:02,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:23:02,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:23:02,981 INFO L87 Difference]: Start difference. First operand 128 states and 172 transitions. Second operand 7 states. [2019-12-07 17:23:03,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:03,016 INFO L93 Difference]: Finished difference Result 157 states and 212 transitions. [2019-12-07 17:23:03,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:23:03,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-07 17:23:03,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:03,017 INFO L225 Difference]: With dead ends: 157 [2019-12-07 17:23:03,017 INFO L226 Difference]: Without dead ends: 155 [2019-12-07 17:23:03,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:23:03,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-07 17:23:03,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 133. [2019-12-07 17:23:03,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-12-07 17:23:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 178 transitions. [2019-12-07 17:23:03,030 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 178 transitions. Word has length 41 [2019-12-07 17:23:03,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:03,030 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 178 transitions. [2019-12-07 17:23:03,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:23:03,030 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 178 transitions. [2019-12-07 17:23:03,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 17:23:03,031 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:03,031 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:23:03,031 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:03,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:03,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1310398175, now seen corresponding path program 1 times [2019-12-07 17:23:03,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:03,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615351758] [2019-12-07 17:23:03,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 17:23:03,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615351758] [2019-12-07 17:23:03,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:23:03,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:23:03,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748147525] [2019-12-07 17:23:03,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:23:03,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:03,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:23:03,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:23:03,052 INFO L87 Difference]: Start difference. First operand 133 states and 178 transitions. Second operand 3 states. [2019-12-07 17:23:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:03,065 INFO L93 Difference]: Finished difference Result 255 states and 335 transitions. [2019-12-07 17:23:03,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:23:03,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 17:23:03,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:03,066 INFO L225 Difference]: With dead ends: 255 [2019-12-07 17:23:03,066 INFO L226 Difference]: Without dead ends: 133 [2019-12-07 17:23:03,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:23:03,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-12-07 17:23:03,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2019-12-07 17:23:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-12-07 17:23:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 172 transitions. [2019-12-07 17:23:03,077 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 172 transitions. Word has length 44 [2019-12-07 17:23:03,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:03,077 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 172 transitions. [2019-12-07 17:23:03,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:23:03,077 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 172 transitions. [2019-12-07 17:23:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 17:23:03,078 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:03,078 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:23:03,078 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:03,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:03,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1376186339, now seen corresponding path program 1 times [2019-12-07 17:23:03,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:03,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6298022] [2019-12-07 17:23:03,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,111 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 17:23:03,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6298022] [2019-12-07 17:23:03,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722578009] [2019-12-07 17:23:03,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,156 INFO L264 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 53 conjunts are in the unsatisfiable core [2019-12-07 17:23:03,166 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:23:03,179 INFO L377 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 6 treesize of output 5 [2019-12-07 17:23:03,179 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:03,183 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:03,184 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:23:03,184 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-12-07 17:23:03,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:03,246 INFO L343 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2019-12-07 17:23:03,246 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 60 [2019-12-07 17:23:03,246 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:03,293 INFO L614 ElimStorePlain]: treesize reduction 22, result has 80.5 percent of original size [2019-12-07 17:23:03,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:03,321 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:03,322 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 88 [2019-12-07 17:23:03,322 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:03,377 INFO L614 ElimStorePlain]: treesize reduction 52, result has 62.6 percent of original size [2019-12-07 17:23:03,378 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:23:03,378 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:87 [2019-12-07 17:23:03,461 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:03,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:23:03,462 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:03,470 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:03,471 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:23:03,471 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:03,480 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:03,480 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:23:03,481 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:03,484 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 17:23:03,484 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:03,597 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-12-07 17:23:03,597 INFO L614 ElimStorePlain]: treesize reduction 18, result has 90.1 percent of original size [2019-12-07 17:23:03,598 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-12-07 17:23:03,598 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:262, output treesize:163 [2019-12-07 17:23:03,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:03,667 INFO L430 ElimStorePlain]: Different costs {9=[|v_#memory_$Pointer$.offset_25|, |v_#memory_$Pointer$.base_27|], 12=[v_prenex_24], 14=[v_prenex_22], 22=[v_prenex_19, v_prenex_18]} [2019-12-07 17:23:03,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:03,879 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 41 [2019-12-07 17:23:03,879 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:04,765 WARN L192 SmtUtils]: Spent 885.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-12-07 17:23:04,765 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:04,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:04,899 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:04,899 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 127 [2019-12-07 17:23:04,900 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:05,655 WARN L192 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 118 [2019-12-07 17:23:05,656 INFO L614 ElimStorePlain]: treesize reduction 77, result has 84.9 percent of original size [2019-12-07 17:23:05,702 INFO L343 Elim1Store]: treesize reduction 20, result has 73.0 percent of original size [2019-12-07 17:23:05,702 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 153 [2019-12-07 17:23:05,703 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:06,227 WARN L192 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 113 [2019-12-07 17:23:06,227 INFO L614 ElimStorePlain]: treesize reduction 7, result has 98.2 percent of original size [2019-12-07 17:23:06,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:06,290 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:06,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 104 [2019-12-07 17:23:06,291 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:06,585 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 108 [2019-12-07 17:23:06,585 INFO L614 ElimStorePlain]: treesize reduction 70, result has 83.3 percent of original size [2019-12-07 17:23:06,715 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-12-07 17:23:06,715 INFO L343 Elim1Store]: treesize reduction 32, result has 87.1 percent of original size [2019-12-07 17:23:06,715 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 167 treesize of output 306 [2019-12-07 17:23:06,716 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:06,998 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2019-12-07 17:23:06,998 INFO L614 ElimStorePlain]: treesize reduction 120, result has 73.8 percent of original size [2019-12-07 17:23:07,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:07,073 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:07,073 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 149 treesize of output 236 [2019-12-07 17:23:07,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:07,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:07,133 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-12-07 17:23:08,732 WARN L192 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 292 DAG size of output: 128 [2019-12-07 17:23:08,733 INFO L614 ElimStorePlain]: treesize reduction 42332, result has 1.2 percent of original size [2019-12-07 17:23:08,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,740 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-12-07 17:23:08,740 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:507, output treesize:584 [2019-12-07 17:23:08,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:08,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:09,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:09,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:09,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:09,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:09,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:09,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:09,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:09,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:09,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:09,322 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 119 [2019-12-07 17:23:09,820 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2019-12-07 17:23:09,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 17:23:10,531 WARN L192 SmtUtils]: Spent 637.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2019-12-07 17:23:12,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 12 terms [2019-12-07 17:23:12,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:12,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:12,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:12,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:13,049 WARN L192 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 396 DAG size of output: 61 [2019-12-07 17:23:13,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:13,054 INFO L430 ElimStorePlain]: Different costs {10=[v_prenex_118, |#memory_$Pointer$.base|, |#memory_$Pointer$.offset|, v_prenex_117], 18=[v_prenex_114, v_prenex_115]} [2019-12-07 17:23:13,062 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:13,062 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 63 [2019-12-07 17:23:13,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:13,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:13,064 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:23:13,159 INFO L614 ElimStorePlain]: treesize reduction 10, result has 96.6 percent of original size [2019-12-07 17:23:13,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:13,184 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:13,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 103 treesize of output 120 [2019-12-07 17:23:13,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:13,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:13,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:13,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:13,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:13,187 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:23:13,270 INFO L614 ElimStorePlain]: treesize reduction 34, result has 86.8 percent of original size [2019-12-07 17:23:13,278 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:13,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 29 [2019-12-07 17:23:13,279 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:13,313 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:13,346 INFO L343 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2019-12-07 17:23:13,347 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 72 [2019-12-07 17:23:13,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:13,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:13,348 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:13,361 INFO L614 ElimStorePlain]: treesize reduction 127, result has 5.2 percent of original size [2019-12-07 17:23:13,361 INFO L502 ElimStorePlain]: Eliminatee v_prenex_114 vanished before elimination [2019-12-07 17:23:13,361 INFO L502 ElimStorePlain]: Eliminatee v_prenex_115 vanished before elimination [2019-12-07 17:23:13,361 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:23:13,361 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:348, output treesize:7 [2019-12-07 17:23:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:23:13,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:23:13,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 16 [2019-12-07 17:23:13,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038037238] [2019-12-07 17:23:13,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:23:13,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:13,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:23:13,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:23:13,430 INFO L87 Difference]: Start difference. First operand 131 states and 172 transitions. Second operand 16 states. [2019-12-07 17:23:18,199 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 156 [2019-12-07 17:23:25,510 WARN L192 SmtUtils]: Spent 7.22 s on a formula simplification. DAG size of input: 182 DAG size of output: 162 [2019-12-07 17:23:25,959 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 165 [2019-12-07 17:23:26,230 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 130 [2019-12-07 17:23:35,798 WARN L192 SmtUtils]: Spent 5.22 s on a formula simplification. DAG size of input: 214 DAG size of output: 208 [2019-12-07 17:23:37,082 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 216 DAG size of output: 210 [2019-12-07 17:23:40,140 WARN L192 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 179 [2019-12-07 17:23:42,770 WARN L192 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 183 [2019-12-07 17:23:50,723 WARN L192 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 216 DAG size of output: 210 [2019-12-07 17:23:53,467 WARN L192 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 184 DAG size of output: 164 [2019-12-07 17:23:53,958 WARN L192 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 181 [2019-12-07 17:23:56,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:56,085 INFO L93 Difference]: Finished difference Result 292 states and 381 transitions. [2019-12-07 17:23:56,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 17:23:56,086 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2019-12-07 17:23:56,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:56,087 INFO L225 Difference]: With dead ends: 292 [2019-12-07 17:23:56,087 INFO L226 Difference]: Without dead ends: 177 [2019-12-07 17:23:56,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2019-12-07 17:23:56,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-12-07 17:23:56,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 160. [2019-12-07 17:23:56,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-12-07 17:23:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2019-12-07 17:23:56,103 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 44 [2019-12-07 17:23:56,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:56,103 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2019-12-07 17:23:56,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:23:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2019-12-07 17:23:56,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 17:23:56,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:56,104 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:23:56,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:56,305 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:56,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:56,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1523797054, now seen corresponding path program 2 times [2019-12-07 17:23:56,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:56,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662010014] [2019-12-07 17:23:56,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:56,704 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 17:23:56,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662010014] [2019-12-07 17:23:56,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388048718] [2019-12-07 17:23:56,704 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:56,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:23:56,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:23:56,750 INFO L264 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 66 conjunts are in the unsatisfiable core [2019-12-07 17:23:56,752 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:23:56,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:56,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:56,763 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:23:56,771 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:56,771 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 44 [2019-12-07 17:23:56,771 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:56,803 INFO L614 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-12-07 17:23:56,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:56,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:56,808 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:23:56,816 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:56,816 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 44 [2019-12-07 17:23:56,817 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:56,846 INFO L614 ElimStorePlain]: treesize reduction 18, result has 77.2 percent of original size [2019-12-07 17:23:56,846 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:23:56,847 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:61 [2019-12-07 17:23:56,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:57,761 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:23:57,823 INFO L343 Elim1Store]: treesize reduction 24, result has 78.2 percent of original size [2019-12-07 17:23:57,823 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 169 treesize of output 153 [2019-12-07 17:23:57,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:57,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:23:57,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:57,837 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:23:57,876 INFO L614 ElimStorePlain]: treesize reduction 103, result has 43.4 percent of original size [2019-12-07 17:23:57,887 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:57,887 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 67 [2019-12-07 17:23:57,887 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:57,898 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:57,898 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:23:57,899 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:181, output treesize:64 [2019-12-07 17:24:05,555 WARN L192 SmtUtils]: Spent 7.29 s on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 17:24:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:24:05,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:24:05,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 28 [2019-12-07 17:24:05,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675725974] [2019-12-07 17:24:05,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 17:24:05,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:05,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 17:24:05,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:24:05,804 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand 28 states. [2019-12-07 17:24:06,378 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-12-07 17:24:06,756 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-12-07 17:24:07,132 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-12-07 17:24:07,385 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 51 [2019-12-07 17:24:07,569 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 45 [2019-12-07 17:24:33,361 WARN L192 SmtUtils]: Spent 15.13 s on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2019-12-07 17:24:43,629 WARN L192 SmtUtils]: Spent 8.12 s on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-12-07 17:24:54,936 WARN L192 SmtUtils]: Spent 9.15 s on a formula simplification. DAG size of input: 81 DAG size of output: 81 [2019-12-07 17:25:09,838 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 17:25:10,032 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-07 17:25:18,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:25:18,153 INFO L93 Difference]: Finished difference Result 287 states and 370 transitions. [2019-12-07 17:25:18,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 17:25:18,154 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2019-12-07 17:25:18,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:25:18,155 INFO L225 Difference]: With dead ends: 287 [2019-12-07 17:25:18,155 INFO L226 Difference]: Without dead ends: 191 [2019-12-07 17:25:18,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 35 SyntacticMatches, 11 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 46.0s TimeCoverageRelationStatistics Valid=407, Invalid=2898, Unknown=1, NotChecked=0, Total=3306 [2019-12-07 17:25:18,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-07 17:25:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2019-12-07 17:25:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-12-07 17:25:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 222 transitions. [2019-12-07 17:25:18,173 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 222 transitions. Word has length 47 [2019-12-07 17:25:18,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:25:18,173 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 222 transitions. [2019-12-07 17:25:18,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 17:25:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 222 transitions. [2019-12-07 17:25:18,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 17:25:18,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:18,174 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-12-07 17:25:18,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:25:18,375 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:18,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:18,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1031600160, now seen corresponding path program 1 times [2019-12-07 17:25:18,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:25:18,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299934573] [2019-12-07 17:25:18,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:25:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 17:25:18,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299934573] [2019-12-07 17:25:18,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632273609] [2019-12-07 17:25:18,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:25:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:18,831 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 74 conjunts are in the unsatisfiable core [2019-12-07 17:25:18,834 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:25:18,840 WARN L213 Elim1Store]: Array PQE input equivalent to false [2019-12-07 17:25:18,840 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:18,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:25:18,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:25:18,846 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:25:18,853 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:25:18,853 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 44 [2019-12-07 17:25:18,854 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:18,883 INFO L614 ElimStorePlain]: treesize reduction 18, result has 80.6 percent of original size [2019-12-07 17:25:18,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:25:18,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:25:18,889 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:25:18,896 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:25:18,896 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 44 [2019-12-07 17:25:18,897 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:18,926 INFO L614 ElimStorePlain]: treesize reduction 14, result has 82.3 percent of original size [2019-12-07 17:25:18,926 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:25:18,927 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:179, output treesize:65 [2019-12-07 17:25:19,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:19,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,117 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 98 [2019-12-07 17:25:20,117 INFO L343 Elim1Store]: treesize reduction 48, result has 85.2 percent of original size [2019-12-07 17:25:20,118 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 137 treesize of output 355 [2019-12-07 17:25:20,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:20,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:20,268 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:20,752 WARN L192 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 556 DAG size of output: 42 [2019-12-07 17:25:20,753 INFO L614 ElimStorePlain]: treesize reduction 53485, result has 0.2 percent of original size [2019-12-07 17:25:20,756 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:25:20,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:25:20,757 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:25:20,786 INFO L343 Elim1Store]: treesize reduction 18, result has 71.4 percent of original size [2019-12-07 17:25:20,786 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 77 [2019-12-07 17:25:20,787 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:20,820 INFO L614 ElimStorePlain]: treesize reduction 67, result has 56.5 percent of original size [2019-12-07 17:25:20,820 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:25:20,820 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:153, output treesize:87 [2019-12-07 17:25:21,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:21,040 INFO L430 ElimStorePlain]: Different costs {20=[|v_#memory_$Pointer$.base_32|], 30=[|v_#memory_$Pointer$.offset_30|]} [2019-12-07 17:25:21,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:25:21,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:25:21,049 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:25:21,054 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:25:21,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:25:21,056 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:25:21,059 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:25:21,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:25:21,069 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 103 [2019-12-07 17:25:21,070 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:21,073 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 17:25:21,073 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:21,080 INFO L614 ElimStorePlain]: treesize reduction 188, result has 0.5 percent of original size [2019-12-07 17:25:21,081 INFO L502 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_30| vanished before elimination [2019-12-07 17:25:21,081 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:25:21,081 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:311, output treesize:1 [2019-12-07 17:25:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:25:21,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:25:21,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 27 [2019-12-07 17:25:21,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216846021] [2019-12-07 17:25:21,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 17:25:21,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:25:21,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 17:25:21,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2019-12-07 17:25:21,099 INFO L87 Difference]: Start difference. First operand 174 states and 222 transitions. Second operand 27 states. [2019-12-07 17:25:21,705 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-12-07 17:25:21,856 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-12-07 17:25:22,409 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-07 17:25:22,763 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-12-07 17:25:23,353 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-12-07 17:25:23,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:25:23,663 INFO L93 Difference]: Finished difference Result 252 states and 326 transitions. [2019-12-07 17:25:23,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 17:25:23,664 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 46 [2019-12-07 17:25:23,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:25:23,665 INFO L225 Difference]: With dead ends: 252 [2019-12-07 17:25:23,665 INFO L226 Difference]: Without dead ends: 228 [2019-12-07 17:25:23,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 36 SyntacticMatches, 12 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=373, Invalid=2177, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 17:25:23,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-12-07 17:25:23,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 193. [2019-12-07 17:25:23,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-12-07 17:25:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 248 transitions. [2019-12-07 17:25:23,688 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 248 transitions. Word has length 46 [2019-12-07 17:25:23,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:25:23,689 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 248 transitions. [2019-12-07 17:25:23,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 17:25:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 248 transitions. [2019-12-07 17:25:23,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 17:25:23,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:23,690 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-12-07 17:25:23,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:25:23,890 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:23,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:23,891 INFO L82 PathProgramCache]: Analyzing trace with hash -773434722, now seen corresponding path program 1 times [2019-12-07 17:25:23,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:25:23,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168071793] [2019-12-07 17:25:23,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:25:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:24,334 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 17:25:24,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168071793] [2019-12-07 17:25:24,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92597] [2019-12-07 17:25:24,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:25:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:24,375 INFO L264 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 67 conjunts are in the unsatisfiable core [2019-12-07 17:25:24,377 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:25:24,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:25:24,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:25:24,391 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:25:24,404 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:25:24,404 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 44 [2019-12-07 17:25:24,405 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:24,407 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 17:25:24,407 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:24,446 INFO L614 ElimStorePlain]: treesize reduction 14, result has 84.9 percent of original size [2019-12-07 17:25:24,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:25:24,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:25:24,450 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:25:24,458 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:25:24,458 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 44 [2019-12-07 17:25:24,459 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:24,489 INFO L614 ElimStorePlain]: treesize reduction 18, result has 78.3 percent of original size [2019-12-07 17:25:24,489 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:25:24,489 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:179, output treesize:65 [2019-12-07 17:25:24,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:24,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:24,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:24,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:25,267 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:25:25,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:25:25,268 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:25:25,269 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:25:25,297 INFO L343 Elim1Store]: treesize reduction 24, result has 68.0 percent of original size [2019-12-07 17:25:25,297 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 100 treesize of output 112 [2019-12-07 17:25:25,298 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:25,344 INFO L614 ElimStorePlain]: treesize reduction 91, result has 65.4 percent of original size [2019-12-07 17:25:25,513 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-12-07 17:25:25,514 INFO L343 Elim1Store]: treesize reduction 40, result has 82.3 percent of original size [2019-12-07 17:25:25,514 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 161 treesize of output 264 [2019-12-07 17:25:25,515 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:25,565 INFO L614 ElimStorePlain]: treesize reduction 192, result has 30.2 percent of original size [2019-12-07 17:25:25,565 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:25:25,566 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:153, output treesize:83 [2019-12-07 17:25:25,799 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_33|], 12=[|v_#memory_$Pointer$.base_35|]} [2019-12-07 17:25:25,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:25:25,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2019-12-07 17:25:25,803 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:25,813 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:25:25,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:25:25,825 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:25:25,825 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 64 [2019-12-07 17:25:25,826 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:25,842 INFO L614 ElimStorePlain]: treesize reduction 22, result has 60.0 percent of original size [2019-12-07 17:25:25,842 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:25:25,842 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:105, output treesize:42 [2019-12-07 17:25:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:25:26,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:25:26,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 33 [2019-12-07 17:25:26,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248893452] [2019-12-07 17:25:26,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 17:25:26,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:25:26,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 17:25:26,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 17:25:26,051 INFO L87 Difference]: Start difference. First operand 193 states and 248 transitions. Second operand 33 states. [2019-12-07 17:25:34,818 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 73 [2019-12-07 17:25:35,072 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 66 [2019-12-07 17:25:40,259 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-12-07 17:25:42,498 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2019-12-07 17:25:42,882 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 78 [2019-12-07 17:25:43,061 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 83 [2019-12-07 17:25:43,361 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 82 [2019-12-07 17:25:52,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:25:52,044 INFO L93 Difference]: Finished difference Result 265 states and 337 transitions. [2019-12-07 17:25:52,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 17:25:52,044 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 46 [2019-12-07 17:25:52,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:25:52,046 INFO L225 Difference]: With dead ends: 265 [2019-12-07 17:25:52,046 INFO L226 Difference]: Without dead ends: 261 [2019-12-07 17:25:52,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=542, Invalid=3618, Unknown=0, NotChecked=0, Total=4160 [2019-12-07 17:25:52,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-12-07 17:25:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 210. [2019-12-07 17:25:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-07 17:25:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 273 transitions. [2019-12-07 17:25:52,067 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 273 transitions. Word has length 46 [2019-12-07 17:25:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:25:52,068 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 273 transitions. [2019-12-07 17:25:52,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 17:25:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 273 transitions. [2019-12-07 17:25:52,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 17:25:52,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:52,069 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-12-07 17:25:52,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:25:52,270 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:52,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:52,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1166461732, now seen corresponding path program 1 times [2019-12-07 17:25:52,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:25:52,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118870573] [2019-12-07 17:25:52,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:25:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 17:25:52,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118870573] [2019-12-07 17:25:52,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444143252] [2019-12-07 17:25:52,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:25:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:52,544 INFO L264 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 52 conjunts are in the unsatisfiable core [2019-12-07 17:25:52,545 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:25:52,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:25:52,609 INFO L343 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2019-12-07 17:25:52,609 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 60 [2019-12-07 17:25:52,609 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:52,637 INFO L614 ElimStorePlain]: treesize reduction 22, result has 68.6 percent of original size [2019-12-07 17:25:52,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:52,638 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:25:52,638 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:48 [2019-12-07 17:25:52,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:52,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:52,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:52,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:52,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:53,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:25:53,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:53,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:53,169 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_34|], 28=[|v_#memory_$Pointer$.base_37|]} [2019-12-07 17:25:53,172 INFO L377 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 31 treesize of output 27 [2019-12-07 17:25:53,172 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:25:53,184 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:25:53,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:25:53,188 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:25:53,331 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-12-07 17:25:53,332 INFO L343 Elim1Store]: treesize reduction 62, result has 75.8 percent of original size [2019-12-07 17:25:53,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 64 treesize of output 223 [2019-12-07 17:25:53,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:53,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:53,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:53,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:53,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:53,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:25:53,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:53,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:53,336 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 5 xjuncts. [2019-12-07 17:25:53,430 INFO L614 ElimStorePlain]: treesize reduction 1463, result has 4.6 percent of original size [2019-12-07 17:25:53,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:53,431 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:25:53,431 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:71 [2019-12-07 17:25:53,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:53,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:53,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:53,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:53,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:53,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:53,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:53,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:53,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:53,892 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:25:53,892 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 49 [2019-12-07 17:25:53,893 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:53,899 INFO L614 ElimStorePlain]: treesize reduction 14, result has 39.1 percent of original size [2019-12-07 17:25:53,899 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:25:53,899 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:4 [2019-12-07 17:25:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:25:53,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:25:53,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2019-12-07 17:25:53,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020780466] [2019-12-07 17:25:53,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 17:25:53,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:25:53,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 17:25:53,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2019-12-07 17:25:53,915 INFO L87 Difference]: Start difference. First operand 210 states and 273 transitions. Second operand 26 states. [2019-12-07 17:25:56,329 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-12-07 17:25:56,800 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-12-07 17:25:57,171 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-12-07 17:25:57,345 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-12-07 17:25:57,486 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-12-07 17:25:59,766 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-07 17:25:59,900 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-07 17:26:00,074 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-12-07 17:26:02,537 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-12-07 17:26:02,738 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-12-07 17:26:02,899 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-12-07 17:26:03,083 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-12-07 17:26:03,220 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-12-07 17:26:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:09,873 INFO L93 Difference]: Finished difference Result 290 states and 364 transitions. [2019-12-07 17:26:09,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 17:26:09,874 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-12-07 17:26:09,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:09,875 INFO L225 Difference]: With dead ends: 290 [2019-12-07 17:26:09,875 INFO L226 Difference]: Without dead ends: 234 [2019-12-07 17:26:09,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 36 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=556, Invalid=2636, Unknown=0, NotChecked=0, Total=3192 [2019-12-07 17:26:09,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-12-07 17:26:09,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 182. [2019-12-07 17:26:09,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-12-07 17:26:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 229 transitions. [2019-12-07 17:26:09,895 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 229 transitions. Word has length 46 [2019-12-07 17:26:09,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:09,895 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 229 transitions. [2019-12-07 17:26:09,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 17:26:09,895 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 229 transitions. [2019-12-07 17:26:09,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:26:09,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:09,896 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:10,096 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:26:10,097 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:10,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:10,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1219363168, now seen corresponding path program 1 times [2019-12-07 17:26:10,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:10,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798792860] [2019-12-07 17:26:10,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:10,503 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 44 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 17:26:10,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798792860] [2019-12-07 17:26:10,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053222082] [2019-12-07 17:26:10,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:26:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:10,557 INFO L264 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 68 conjunts are in the unsatisfiable core [2019-12-07 17:26:10,558 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:26:10,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:26:10,597 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:26:10,604 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:10,605 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 40 [2019-12-07 17:26:10,605 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:10,638 INFO L614 ElimStorePlain]: treesize reduction 12, result has 85.9 percent of original size [2019-12-07 17:26:10,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:26:10,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:26:10,644 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:26:10,650 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-07 17:26:10,650 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 24 [2019-12-07 17:26:10,650 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:10,664 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:10,665 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:26:10,665 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2019-12-07 17:26:10,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:10,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:10,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:10,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:26:11,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:11,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:11,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:11,874 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 79 [2019-12-07 17:26:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 17:26:12,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:26:12,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2019-12-07 17:26:12,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276443616] [2019-12-07 17:26:12,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 17:26:12,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:12,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 17:26:12,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2019-12-07 17:26:12,024 INFO L87 Difference]: Start difference. First operand 182 states and 229 transitions. Second operand 29 states. [2019-12-07 17:26:12,368 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 68 [2019-12-07 17:26:12,551 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 71 [2019-12-07 17:26:12,866 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 72 [2019-12-07 17:26:13,016 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 64 [2019-12-07 17:26:13,825 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 75 [2019-12-07 17:26:14,005 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 71 [2019-12-07 17:26:14,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:14,201 INFO L93 Difference]: Finished difference Result 270 states and 346 transitions. [2019-12-07 17:26:14,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 17:26:14,201 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 53 [2019-12-07 17:26:14,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:14,202 INFO L225 Difference]: With dead ends: 270 [2019-12-07 17:26:14,202 INFO L226 Difference]: Without dead ends: 210 [2019-12-07 17:26:14,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=331, Invalid=2021, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 17:26:14,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-12-07 17:26:14,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 188. [2019-12-07 17:26:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-12-07 17:26:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 235 transitions. [2019-12-07 17:26:14,222 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 235 transitions. Word has length 53 [2019-12-07 17:26:14,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:14,222 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 235 transitions. [2019-12-07 17:26:14,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 17:26:14,222 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 235 transitions. [2019-12-07 17:26:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 17:26:14,223 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:14,223 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:14,423 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:26:14,423 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:14,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:14,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1939331367, now seen corresponding path program 2 times [2019-12-07 17:26:14,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:14,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187362789] [2019-12-07 17:26:14,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 4 proven. 66 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 17:26:14,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187362789] [2019-12-07 17:26:14,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211411324] [2019-12-07 17:26:14,948 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:26:15,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:26:15,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:26:15,005 INFO L264 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 17:26:15,006 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:26:15,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:26:15,059 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2019-12-07 17:26:15,060 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:15,071 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:15,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:26:15,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2019-12-07 17:26:15,076 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:15,085 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:15,085 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:26:15,086 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:73 [2019-12-07 17:26:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 51 proven. 20 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 17:26:15,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:26:15,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 28 [2019-12-07 17:26:15,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541752992] [2019-12-07 17:26:15,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 17:26:15,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:15,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 17:26:15,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:26:15,885 INFO L87 Difference]: Start difference. First operand 188 states and 235 transitions. Second operand 28 states. [2019-12-07 17:26:17,550 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-12-07 17:26:17,855 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2019-12-07 17:26:18,196 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 87 [2019-12-07 17:26:18,370 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 79 [2019-12-07 17:26:18,603 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 77 [2019-12-07 17:26:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:18,806 INFO L93 Difference]: Finished difference Result 274 states and 345 transitions. [2019-12-07 17:26:18,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 17:26:18,806 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-12-07 17:26:18,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:18,807 INFO L225 Difference]: With dead ends: 274 [2019-12-07 17:26:18,807 INFO L226 Difference]: Without dead ends: 196 [2019-12-07 17:26:18,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=361, Invalid=2395, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 17:26:18,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-12-07 17:26:18,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 148. [2019-12-07 17:26:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-12-07 17:26:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 177 transitions. [2019-12-07 17:26:18,825 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 177 transitions. Word has length 60 [2019-12-07 17:26:18,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:18,825 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 177 transitions. [2019-12-07 17:26:18,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 17:26:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 177 transitions. [2019-12-07 17:26:18,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 17:26:18,826 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:18,826 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:19,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:26:19,027 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:19,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:19,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1664417444, now seen corresponding path program 1 times [2019-12-07 17:26:19,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:19,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072413829] [2019-12-07 17:26:19,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 17:26:19,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072413829] [2019-12-07 17:26:19,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451516177] [2019-12-07 17:26:19,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:26:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:19,237 INFO L264 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 17:26:19,238 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:26:19,256 INFO L377 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 6 treesize of output 5 [2019-12-07 17:26:19,257 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:19,260 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:19,261 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:26:19,261 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 17:26:19,289 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:19,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:26:19,290 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:19,293 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:19,293 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:26:19,293 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-12-07 17:26:19,341 INFO L343 Elim1Store]: treesize reduction 56, result has 47.7 percent of original size [2019-12-07 17:26:19,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 60 [2019-12-07 17:26:19,341 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:19,363 INFO L614 ElimStorePlain]: treesize reduction 22, result has 65.6 percent of original size [2019-12-07 17:26:19,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:19,364 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:26:19,364 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:57 [2019-12-07 17:26:19,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:19,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:19,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:19,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:19,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:19,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:19,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 17:26:19,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:26:19,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-12-07 17:26:19,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975681382] [2019-12-07 17:26:19,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 17:26:19,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:19,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 17:26:19,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:26:19,827 INFO L87 Difference]: Start difference. First operand 148 states and 177 transitions. Second operand 23 states. [2019-12-07 17:26:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:28,828 INFO L93 Difference]: Finished difference Result 159 states and 188 transitions. [2019-12-07 17:26:28,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:26:28,829 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2019-12-07 17:26:28,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:28,829 INFO L225 Difference]: With dead ends: 159 [2019-12-07 17:26:28,830 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 17:26:28,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 17:26:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 17:26:28,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 53. [2019-12-07 17:26:28,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 17:26:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-12-07 17:26:28,838 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 50 [2019-12-07 17:26:28,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:28,839 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-12-07 17:26:28,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 17:26:28,839 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-12-07 17:26:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:26:28,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:28,839 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 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] [2019-12-07 17:26:29,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:26:29,040 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:29,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:29,041 INFO L82 PathProgramCache]: Analyzing trace with hash -447177867, now seen corresponding path program 2 times [2019-12-07 17:26:29,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:29,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475864494] [2019-12-07 17:26:29,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:29,088 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-12-07 17:26:29,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475864494] [2019-12-07 17:26:29,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:29,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:26:29,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43837793] [2019-12-07 17:26:29,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:26:29,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:29,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:26:29,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:26:29,089 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 6 states. [2019-12-07 17:26:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:29,110 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-12-07 17:26:29,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:26:29,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-07 17:26:29,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:29,111 INFO L225 Difference]: With dead ends: 62 [2019-12-07 17:26:29,111 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 17:26:29,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:26:29,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 17:26:29,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-12-07 17:26:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 17:26:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-12-07 17:26:29,119 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 52 [2019-12-07 17:26:29,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:29,119 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-12-07 17:26:29,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:26:29,119 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-12-07 17:26:29,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:26:29,120 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:29,120 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 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] [2019-12-07 17:26:29,120 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:29,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:29,120 INFO L82 PathProgramCache]: Analyzing trace with hash -200998585, now seen corresponding path program 3 times [2019-12-07 17:26:29,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:29,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32106774] [2019-12-07 17:26:29,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 17:26:29,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32106774] [2019-12-07 17:26:29,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744090467] [2019-12-07 17:26:29,411 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:26:29,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-07 17:26:29,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:26:29,473 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 86 conjunts are in the unsatisfiable core [2019-12-07 17:26:29,474 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:26:29,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:26:29,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:26:29,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2019-12-07 17:26:29,517 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:29,530 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:29,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:26:29,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:26:29,536 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2019-12-07 17:26:29,536 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:29,549 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:29,549 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:26:29,550 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:62 [2019-12-07 17:26:29,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:26:29,739 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:26:29,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:26:29,740 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:26:29,749 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:29,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 100 [2019-12-07 17:26:29,749 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:29,788 INFO L614 ElimStorePlain]: treesize reduction 57, result has 63.0 percent of original size [2019-12-07 17:26:29,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:26:29,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:26:29,792 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:26:29,793 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:26:29,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:26:29,794 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:26:29,816 INFO L343 Elim1Store]: treesize reduction 18, result has 67.3 percent of original size [2019-12-07 17:26:29,816 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2019-12-07 17:26:29,816 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:29,845 INFO L614 ElimStorePlain]: treesize reduction 49, result has 60.2 percent of original size [2019-12-07 17:26:29,845 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:26:29,845 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-07 17:26:30,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:26:30,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:26:30,037 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:30,037 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 94 [2019-12-07 17:26:30,037 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:30,071 INFO L614 ElimStorePlain]: treesize reduction 9, result has 91.2 percent of original size [2019-12-07 17:26:30,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:26:30,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:26:30,074 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:26:30,089 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:30,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 92 [2019-12-07 17:26:30,090 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:30,121 INFO L614 ElimStorePlain]: treesize reduction 65, result has 50.4 percent of original size [2019-12-07 17:26:30,122 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:26:30,122 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:66 [2019-12-07 17:26:30,552 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 17:26:30,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:26:30,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2019-12-07 17:26:30,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515356227] [2019-12-07 17:26:30,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 17:26:30,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:30,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 17:26:30,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:26:30,554 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 28 states. [2019-12-07 17:26:32,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:32,073 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2019-12-07 17:26:32,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 17:26:32,074 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2019-12-07 17:26:32,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:32,074 INFO L225 Difference]: With dead ends: 59 [2019-12-07 17:26:32,074 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:26:32,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=328, Invalid=1742, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 17:26:32,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:26:32,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:26:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:26:32,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:26:32,075 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2019-12-07 17:26:32,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:32,075 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:26:32,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 17:26:32,075 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:26:32,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:26:32,276 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:26:32,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 17:26:32,456 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 452 DAG size of output: 343 [2019-12-07 17:26:34,159 WARN L192 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 339 DAG size of output: 106 [2019-12-07 17:27:28,949 WARN L192 SmtUtils]: Spent 54.78 s on a formula simplification. DAG size of input: 1201 DAG size of output: 207 [2019-12-07 17:27:29,117 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 69 [2019-12-07 17:27:29,295 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 78 [2019-12-07 17:27:34,591 WARN L192 SmtUtils]: Spent 5.29 s on a formula simplification. DAG size of input: 1004 DAG size of output: 1 [2019-12-07 17:27:34,921 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 81 [2019-12-07 17:27:35,396 WARN L192 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 398 DAG size of output: 72 [2019-12-07 17:27:35,398 INFO L249 CegarLoopResult]: At program point L609(lines 587 610) the Hoare annotation is: true [2019-12-07 17:27:35,398 INFO L246 CegarLoopResult]: For program point L576(lines 576 577) no Hoare annotation was computed. [2019-12-07 17:27:35,399 INFO L242 CegarLoopResult]: At program point L572(lines 572 578) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse3 (= |ULTIMATE.start_main_~#list~0.base| ULTIMATE.start_main_~tail~0.base)) (.cse2 (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~tail~0.offset)) (.cse4 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0.base|)) (.cse1 (= (select |#valid| |ULTIMATE.start_main_~#list~0.base|) 1))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_main_~x~0.offset |ULTIMATE.start_main_~#list~0.offset|) .cse3 (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_~#list~0.base|) .cse4) (let ((.cse6 (select (select |#memory_$Pointer$.base| ULTIMATE.start_re_insert_~x.base) ULTIMATE.start_re_insert_~x.offset)) (.cse5 (+ |ULTIMATE.start_main_~#list~0.offset| 4)) (.cse7 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~x~0.base))) (and .cse0 (<= (+ ULTIMATE.start_main_~n~0.base 2) |ULTIMATE.start_main_~#list~0.base|) (= ULTIMATE.start_main_~n~0.offset |ULTIMATE.start_main_~#list~0.offset|) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)) .cse3 (= 1 (select |#valid| ULTIMATE.start_main_~n~0.base)) (<= (+ ULTIMATE.start_main_~x~0.base 2) |ULTIMATE.start_main_~#list~0.base|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0.base|) .cse5)) .cse2 (not (= 0 .cse6)) (= 0 (select .cse7 4)) (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_remove_~x.base) (= 0 |ULTIMATE.start_main_~#list~0.offset|) (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_re_insert_~x.base) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= .cse6 |ULTIMATE.start_main_~#list~0.base|) (= ULTIMATE.start_main_~x~0.offset 0) (= ULTIMATE.start_main_~x~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0.base|) .cse5)) (= ULTIMATE.start_remove_~x.offset ULTIMATE.start_main_~x~0.offset) .cse4 (= 0 ULTIMATE.start_re_insert_~x.offset) (not (= ULTIMATE.start_main_~n~0.base 0)) .cse1 (= (select .cse7 0) |ULTIMATE.start_main_~#list~0.offset|) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset) |ULTIMATE.start_main_~#list~0.base|) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base) 4) 0) (not (= ULTIMATE.start_main_~x~0.base 0)))))) [2019-12-07 17:27:35,399 INFO L246 CegarLoopResult]: For program point L601(lines 601 602) no Hoare annotation was computed. [2019-12-07 17:27:35,399 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-12-07 17:27:35,399 INFO L242 CegarLoopResult]: At program point L601-2(lines 593 603) the Hoare annotation is: (and (let ((.cse8 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0.base|)) (.cse25 (+ |ULTIMATE.start_main_~#list~0.offset| 4))) (let ((.cse23 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0.base|)) (.cse20 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base)) (.cse24 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base)) (.cse21 (+ ULTIMATE.start_main_~n~0.offset 4)) (.cse17 (select .cse8 .cse25))) (let ((.cse9 (= 0 .cse17)) (.cse1 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~x~0.base) 0) 0)) (.cse0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base) 0)) (.cse11 (exists ((ULTIMATE.start_main_~tail~0.offset Int)) (and (= ULTIMATE.start_main_~n~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0.base|) (+ ULTIMATE.start_main_~tail~0.offset 4))) (or (and (= ULTIMATE.start_main_~n~0.offset ULTIMATE.start_main_~tail~0.offset) (= ULTIMATE.start_main_~n~0.base |ULTIMATE.start_main_~#list~0.base|)) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) (+ ULTIMATE.start_main_~n~0.offset 4))))))) (.cse7 (= 0 ULTIMATE.start_main_~tail~0.offset)) (.cse6 (= 0 (select .cse24 .cse21))) (.cse10 (= (select .cse20 ULTIMATE.start_main_~n~0.offset) |ULTIMATE.start_main_~#list~0.base|)) (.cse2 (= 0 |ULTIMATE.start_main_~#list~0.offset|)) (.cse3 (= ULTIMATE.start_main_~x~0.offset |ULTIMATE.start_main_~#list~0.offset|)) (.cse5 (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1)) (.cse12 (not (= ULTIMATE.start_main_~x~0.base 0))) (.cse4 (select .cse23 .cse25))) (or (and (= .cse0 |ULTIMATE.start_main_~#list~0.base|) .cse1 .cse2 .cse3 (<= (+ .cse4 2) |ULTIMATE.start_main_~#list~0.base|) .cse5 .cse6 (not (= 0 .cse0)) .cse7 (= ULTIMATE.start_main_~n~0.offset (select .cse8 4)) (= 1 (select |#valid| ULTIMATE.start_main_~n~0.base)) (<= (+ ULTIMATE.start_main_~x~0.base 2) |ULTIMATE.start_main_~#list~0.base|) .cse9 (not (= ULTIMATE.start_main_~n~0.base 0)) (= ULTIMATE.start_main_~n~0.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~tail~0.base) (+ ULTIMATE.start_main_~tail~0.offset 4))) (= (select |#valid| |ULTIMATE.start_main_~#list~0.base|) 1) (= (select (select |#memory_$Pointer$.offset| .cse4) 0) |ULTIMATE.start_main_~#list~0.offset|) .cse10 .cse11 .cse12) (let ((.cse13 (not (= ULTIMATE.start_main_~x~0.base .cse4)))) (and .cse13 .cse9 (let ((.cse18 (select .cse24 ULTIMATE.start_main_~n~0.offset))) (let ((.cse15 (= ULTIMATE.start_main_~n~0.base |ULTIMATE.start_main_~#list~0.base|)) (.cse16 (= 0 .cse18))) (let ((.cse14 (let ((.cse19 (let ((.cse22 (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_~#list~0.base|))) (or (and .cse13 .cse22) (and (= 0 ULTIMATE.start_main_~n~0.offset) .cse16 .cse22 .cse10 (= (select .cse23 4) ULTIMATE.start_main_~n~0.base)))))) (or (and (= ULTIMATE.start_main_~n~0.base .cse4) (= ULTIMATE.start_main_~n~0.offset .cse17) (= .cse18 |ULTIMATE.start_main_~#list~0.offset|) .cse19 .cse10 .cse6 (or .cse15 (= 0 (select .cse20 .cse21)))) (and (= .cse4 0) .cse19))))) (or (and .cse1 .cse14 (not (= ULTIMATE.start_main_~x~0.base .cse0)) .cse7) (and (or .cse15 .cse16) .cse14 (= ULTIMATE.start_main_~n~0.offset |ULTIMATE.start_main_~#list~0.offset|) .cse10 .cse11 .cse7))))) .cse2 .cse3 .cse5 .cse12)))))) (= |ULTIMATE.start_main_~#list~0.base| ULTIMATE.start_main_~tail~0.base) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0.base|)) [2019-12-07 17:27:35,399 INFO L242 CegarLoopResult]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse5 (= (select |#valid| |ULTIMATE.start_main_~#list~0.base|) 1)) (.cse4 (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~tail~0.offset)) (.cse1 (= |ULTIMATE.start_main_~#list~0.base| ULTIMATE.start_main_~tail~0.base)) (.cse2 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0.base|))) (or (let ((.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0.base|) (+ |ULTIMATE.start_main_~#list~0.offset| 4)))) (let ((.cse0 (select |#memory_$Pointer$.base| .cse3))) (and (= (select .cse0 0) |ULTIMATE.start_main_~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~x~0.base) 0) 0) (= 0 ULTIMATE.start_main_~n~0.offset) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base) 0) |ULTIMATE.start_main_~#list~0.base|) (= 0 |ULTIMATE.start_main_~#list~0.offset|) (<= (+ ULTIMATE.start_main_~n~0.base 2) |ULTIMATE.start_main_~#list~0.base|) (= ULTIMATE.start_main_~x~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) .cse1 (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) (+ ULTIMATE.start_main_~n~0.offset 4))) .cse2 (not (= 0 |ULTIMATE.start_main_~#list~0.base|)) (= ULTIMATE.start_main_~n~0.offset (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0.base|) 4)) (= 1 (select |#valid| ULTIMATE.start_main_~n~0.base)) (not (= .cse3 0)) (<= (+ ULTIMATE.start_main_~x~0.base 2) |ULTIMATE.start_main_~#list~0.base|) (= ULTIMATE.start_main_~n~0.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~tail~0.base) (+ ULTIMATE.start_main_~tail~0.offset 4))) .cse4 (= (select .cse0 4) 0) .cse5 (= (select (select |#memory_$Pointer$.offset| .cse3) 0) |ULTIMATE.start_main_~#list~0.offset|) (not (= ULTIMATE.start_main_~x~0.base 0))))) (and .cse5 .cse4 (= ULTIMATE.start_main_~x~0.offset |ULTIMATE.start_main_~#list~0.offset|) .cse1 (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_~#list~0.base|) .cse2))) [2019-12-07 17:27:35,399 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 17:27:35,400 INFO L246 CegarLoopResult]: For program point L606(line 606) no Hoare annotation was computed. [2019-12-07 17:27:35,400 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 17:27:35,400 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 17:27:35,400 INFO L242 CegarLoopResult]: At program point L606-2(line 606) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base))) (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~x~0.base)) (.cse1 (select .cse3 ULTIMATE.start_main_~x~0.offset)) (.cse2 (+ |ULTIMATE.start_main_~#list~0.offset| 4))) (and (<= (+ ULTIMATE.start_main_~n~0.base 2) |ULTIMATE.start_main_~#list~0.base|) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)) (= ULTIMATE.start_main_~n~0.offset |ULTIMATE.start_main_~#list~0.offset|) (= |ULTIMATE.start_main_~#list~0.base| ULTIMATE.start_main_~tail~0.base) (= 1 (select |#valid| ULTIMATE.start_main_~n~0.base)) (<= (+ ULTIMATE.start_main_~x~0.base 2) |ULTIMATE.start_main_~#list~0.base|) (= ULTIMATE.start_remove_~x.offset 0) (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~tail~0.offset) (= (select .cse0 0) 0) (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_remove_~x.base) (= 0 |ULTIMATE.start_main_~#list~0.offset|) (= ULTIMATE.start_main_~x~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0.base|) (= (select .cse0 (+ ULTIMATE.start_main_~x~0.offset 4)) 0) (not (= .cse1 0)) (not |ULTIMATE.start_main_#t~short21|) (not (= ULTIMATE.start_main_~n~0.base 0)) (= .cse1 |ULTIMATE.start_main_~#list~0.base|) (= 0 (select (select |#memory_$Pointer$.base| .cse1) .cse2)) (= (select |#valid| |ULTIMATE.start_main_~#list~0.base|) 1) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset) |ULTIMATE.start_main_~#list~0.base|) (= |ULTIMATE.start_main_~#list~0.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0.base|) .cse2)) (not (= ULTIMATE.start_main_~x~0.base 0)) (= (select .cse3 4) 0)))) [2019-12-07 17:27:35,400 INFO L246 CegarLoopResult]: For program point L606-3(line 606) no Hoare annotation was computed. [2019-12-07 17:27:35,400 INFO L246 CegarLoopResult]: For program point L606-4(line 606) no Hoare annotation was computed. [2019-12-07 17:27:35,400 INFO L246 CegarLoopResult]: For program point L569(lines 569 570) no Hoare annotation was computed. [2019-12-07 17:27:35,400 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-12-07 17:27:35,400 INFO L246 CegarLoopResult]: For program point L565(lines 565 571) no Hoare annotation was computed. [2019-12-07 17:27:35,400 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 17:27:35,400 INFO L246 CegarLoopResult]: For program point L574(lines 574 575) no Hoare annotation was computed. [2019-12-07 17:27:35,401 INFO L246 CegarLoopResult]: For program point L574-2(lines 574 575) no Hoare annotation was computed. [2019-12-07 17:27:35,401 INFO L246 CegarLoopResult]: For program point L5(lines 5 7) no Hoare annotation was computed. [2019-12-07 17:27:35,401 INFO L242 CegarLoopResult]: At program point L5-2(lines 4 9) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse3 (= |ULTIMATE.start_main_~#list~0.base| ULTIMATE.start_main_~tail~0.base)) (.cse1 (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~tail~0.offset)) (.cse4 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0.base|)) (.cse2 (= (select |#valid| |ULTIMATE.start_main_~#list~0.base|) 1))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_main_~x~0.offset |ULTIMATE.start_main_~#list~0.offset|) .cse3 (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_~#list~0.base|) .cse4) (let ((.cse7 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base))) (let ((.cse5 (select .cse7 ULTIMATE.start_main_~x~0.offset)) (.cse6 (+ |ULTIMATE.start_main_~#list~0.offset| 4))) (and .cse0 (<= (+ ULTIMATE.start_main_~n~0.base 2) |ULTIMATE.start_main_~#list~0.base|) (= ULTIMATE.start_main_~n~0.offset |ULTIMATE.start_main_~#list~0.offset|) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)) .cse3 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_remove_~x.base) ULTIMATE.start_remove_~x.offset) |ULTIMATE.start_main_~#list~0.offset|) (= 1 (select |#valid| ULTIMATE.start_main_~n~0.base)) (<= (+ ULTIMATE.start_main_~x~0.base 2) |ULTIMATE.start_main_~#list~0.base|) (= ULTIMATE.start_remove_~x.offset 0) .cse1 (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_remove_~x.base) (= ULTIMATE.start_main_~x~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) .cse4 (= (select (select |#memory_$Pointer$.offset| .cse5) .cse6) 0) (= |ULTIMATE.start_main_~#list~0.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_remove_~x.base) ULTIMATE.start_remove_~x.offset)) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~x~0.base) (+ ULTIMATE.start_main_~x~0.offset 4)) 0) (not (= .cse5 0)) (not (= ULTIMATE.start_main_~n~0.base 0)) (= 0 (select (select |#memory_$Pointer$.base| .cse5) .cse6)) .cse2 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset) |ULTIMATE.start_main_~#list~0.base|) (= |ULTIMATE.start_main_~#list~0.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0.base|) .cse6)) (= (select .cse7 4) 0) (not (= ULTIMATE.start_main_~x~0.base 0))))))) [2019-12-07 17:27:35,401 INFO L246 CegarLoopResult]: For program point L5-3(lines 5 7) no Hoare annotation was computed. [2019-12-07 17:27:35,401 INFO L246 CegarLoopResult]: For program point L608(line 608) no Hoare annotation was computed. [2019-12-07 17:27:35,401 INFO L249 CegarLoopResult]: At program point L5-5(lines 4 9) the Hoare annotation is: true [2019-12-07 17:27:35,401 INFO L246 CegarLoopResult]: For program point L604(line 604) no Hoare annotation was computed. [2019-12-07 17:27:35,401 INFO L246 CegarLoopResult]: For program point L567(lines 567 568) no Hoare annotation was computed. [2019-12-07 17:27:35,401 INFO L246 CegarLoopResult]: For program point L567-2(lines 567 568) no Hoare annotation was computed. [2019-12-07 17:27:35,401 INFO L246 CegarLoopResult]: For program point L596(lines 596 597) no Hoare annotation was computed. [2019-12-07 17:27:35,401 INFO L246 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2019-12-07 17:27:35,401 INFO L246 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2019-12-07 17:27:35,402 INFO L249 CegarLoopResult]: At program point is_list_containing_xENTRY(lines 579 586) the Hoare annotation is: true [2019-12-07 17:27:35,402 INFO L242 CegarLoopResult]: At program point L584(line 584) the Hoare annotation is: (let ((.cse32 (+ |is_list_containing_x_#in~l.offset| 4))) (let ((.cse31 (select (select |#memory_$Pointer$.offset| |is_list_containing_x_#in~l.base|) .cse32)) (.cse30 (select (select |#memory_$Pointer$.base| |is_list_containing_x_#in~l.base|) .cse32))) (let ((.cse11 (or (not (= 0 .cse31)) (not (= .cse30 0)))) (.cse13 (= |is_list_containing_x_#t~mem14.offset| .cse31)) (.cse12 (= .cse30 |is_list_containing_x_#t~mem14.base|))) (and (or (not (= |is_list_containing_x_#in~x.offset| |is_list_containing_x_#in~l.offset|)) (not (= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|))) (or (and (forall ((v_prenex_167 Int) (ULTIMATE.start_main_~tail~0.offset Int)) (let ((.cse0 (select |#memory_$Pointer$.base| v_prenex_167))) (let ((.cse1 (select .cse0 0))) (or (not (= 0 (select .cse0 4))) (not (= v_prenex_167 (select (select |#memory_$Pointer$.base| .cse1) (+ ULTIMATE.start_main_~tail~0.offset 4)))) (= 0 .cse1))))) (forall ((v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_12 Int)) (let ((.cse2 (select |#memory_$Pointer$.base| v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_12))) (or (not (= (select .cse2 4) v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_12)) (not (= (select .cse2 0) v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_12)) (= 0 v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_12))))) (and (forall ((|v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_10| Int)) (let ((.cse5 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_10|) 4))) (let ((.cse3 (select |#memory_$Pointer$.offset| .cse5)) (.cse4 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_10|) 4))) (or (not (= 0 (select .cse3 .cse4))) (not (= 0 .cse4)) (not (= (select (select |#memory_$Pointer$.base| .cse5) .cse4) |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_10|)) (not (= 0 (select .cse3 (+ .cse4 4)))) (= 0 .cse5) (not (= |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_10| .cse5)))))) (forall ((|v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_10| Int)) (let ((.cse7 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_10|) 4)) (.cse10 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_10|) 4))) (let ((.cse8 (select |#memory_$Pointer$.base| .cse10)) (.cse6 (select |#memory_$Pointer$.offset| .cse10)) (.cse9 (+ .cse7 4))) (or (not (= 0 (select .cse6 .cse7))) (not (= 0 .cse7)) (not (= (select .cse8 .cse7) |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_10|)) (not (= (select .cse8 .cse9) 0)) (not (= 0 (select .cse6 .cse9))) (= 0 .cse10)))))) (and .cse11 .cse12 .cse13) (forall ((|v_ULTIMATE.start_main_~#list~0.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_17| Int)) (let ((.cse17 (+ |v_ULTIMATE.start_main_~#list~0.offset_BEFORE_CALL_15| 4))) (let ((.cse16 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_17|) .cse17))) (let ((.cse14 (select |#memory_$Pointer$.base| .cse16)) (.cse15 (select |#memory_$Pointer$.offset| .cse16))) (or (not (= (select .cse14 0) |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_17|)) (not (= (select .cse14 4) 0)) (not (= (select .cse15 0) |v_ULTIMATE.start_main_~#list~0.offset_BEFORE_CALL_15|)) (not (<= (+ .cse16 2) |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_17|)) (not (= 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_17|) .cse17))) (not (= (select .cse15 4) 0)))))))) (= |is_list_containing_x_#in~x.offset| is_list_containing_x_~x.offset) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|) (or (forall ((v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_5 Int)) (let ((.cse18 (select |#memory_$Pointer$.base| v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_5))) (let ((.cse19 (select .cse18 0))) (or (not (= (select .cse18 4) 0)) (= v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_5 .cse19) (not (= (select (select |#memory_$Pointer$.base| .cse19) 4) 0)) (= v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_5 0))))) (and .cse11 .cse13 .cse12) (and (or (forall ((v_prenex_138 Int)) (let ((.cse24 (select |#memory_$Pointer$.base| v_prenex_138))) (let ((.cse22 (select .cse24 0))) (let ((.cse23 (select .cse24 4)) (.cse20 (select (select |#memory_$Pointer$.offset| .cse22) 4)) (.cse21 (select |#memory_$Pointer$.offset| v_prenex_138))) (or (not (= .cse20 0)) (not (= 0 (select .cse21 0))) (not (= (select (select |#memory_$Pointer$.base| .cse22) 4) .cse23)) (not (= 0 .cse23)) (= v_prenex_138 .cse22) (not (= .cse20 (select .cse21 4)))))))) (forall ((v_prenex_136 Int) (v_prenex_137 Int)) (= (select (select |#memory_$Pointer$.offset| v_prenex_136) (+ v_prenex_137 4)) 0))) (or (forall ((v_arrayElimCell_48 Int)) (let ((.cse29 (select |#memory_$Pointer$.base| v_arrayElimCell_48))) (let ((.cse27 (select .cse29 0))) (let ((.cse26 (select |#memory_$Pointer$.offset| v_arrayElimCell_48)) (.cse25 (select (select |#memory_$Pointer$.offset| .cse27) 4)) (.cse28 (select .cse29 4))) (or (not (= 0 .cse25)) (not (= (select .cse26 0) 0)) (= .cse27 v_arrayElimCell_48) (not (= (select (select |#memory_$Pointer$.base| .cse27) 4) .cse28)) (not (= (select .cse26 4) .cse25)) (not (= 0 .cse28))))))) (forall ((|v_is_list_containing_x_#in~l.base_BEFORE_CALL_6| Int) (|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_6| Int)) (= 0 (select (select |#memory_$Pointer$.base| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_6|) (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_6| 4))))))) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|) (= |is_list_containing_x_#in~l.offset| is_list_containing_x_~l.offset))))) [2019-12-07 17:27:35,402 INFO L246 CegarLoopResult]: For program point L583(lines 583 584) no Hoare annotation was computed. [2019-12-07 17:27:35,402 INFO L246 CegarLoopResult]: For program point L584-1(line 584) no Hoare annotation was computed. [2019-12-07 17:27:35,402 INFO L246 CegarLoopResult]: For program point is_list_containing_xFINAL(lines 579 586) no Hoare annotation was computed. [2019-12-07 17:27:35,402 INFO L246 CegarLoopResult]: For program point L581(lines 581 582) no Hoare annotation was computed. [2019-12-07 17:27:35,402 INFO L246 CegarLoopResult]: For program point is_list_containing_xEXIT(lines 579 586) no Hoare annotation was computed. [2019-12-07 17:27:35,412 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,413 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,413 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,413 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,413 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,414 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,414 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,414 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,414 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,414 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,414 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,415 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-12-07 17:27:35,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-12-07 17:27:35,415 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,415 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,415 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,416 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,416 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,416 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,416 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,416 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,417 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,417 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,417 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,417 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,417 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,418 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,418 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,418 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,418 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,418 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,419 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,419 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,419 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,419 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,419 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,420 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,420 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,420 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,420 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,421 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,421 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,421 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,421 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,421 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,422 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,422 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,422 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,422 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,422 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,423 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-12-07 17:27:35,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-12-07 17:27:35,423 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,433 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,433 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,433 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,433 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,433 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,433 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,433 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,434 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,434 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,434 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,434 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,434 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,434 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,435 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-12-07 17:27:35,439 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,439 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,439 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,439 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,439 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,440 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,440 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,440 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,440 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,440 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,440 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,441 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,441 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-12-07 17:27:35,441 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-12-07 17:27:35,441 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,441 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,441 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,441 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,442 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,442 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,442 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,442 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,442 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,443 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,443 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,443 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,443 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,443 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,443 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,444 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,444 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,444 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,444 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,444 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,445 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,445 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,445 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,445 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,445 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,446 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,446 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,446 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,446 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,446 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,447 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,447 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,447 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,447 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,447 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,447 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,448 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,448 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-12-07 17:27:35,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-12-07 17:27:35,448 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-12-07 17:27:35,459 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,459 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,459 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,459 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,460 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,460 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,460 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,460 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,460 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,460 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,460 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,461 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-12-07 17:27:35,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-12-07 17:27:35,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,463 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,463 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,463 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,463 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,463 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,464 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,464 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,464 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,464 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,464 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,464 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,464 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,465 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,465 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,465 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-12-07 17:27:35,465 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,465 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,465 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-12-07 17:27:35,466 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,466 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,466 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,466 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,466 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,466 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,466 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,466 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,467 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,467 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:27:35 BoogieIcfgContainer [2019-12-07 17:27:35,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:27:35,468 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:27:35,469 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:27:35,469 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:27:35,469 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:21:57" (3/4) ... [2019-12-07 17:27:35,471 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:27:35,476 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_list_containing_x [2019-12-07 17:27:35,480 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-12-07 17:27:35,480 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 17:27:35,481 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 17:27:35,499 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((#memory_$Pointer$[x][0] == list && #memory_$Pointer$[x][0] == 0) && 0 == list) && x == list) && #memory_$Pointer$[list][list + 4] + 2 <= list) && \valid[x] == 1) && 0 == #memory_$Pointer$[n][n + 4]) && !(0 == #memory_$Pointer$[x][0])) && 0 == tail) && n == #memory_$Pointer$[list][4]) && 1 == \valid[n]) && x + 2 <= list) && 0 == #memory_$Pointer$[list][list + 4]) && !(n == 0)) && n == #memory_$Pointer$[tail][tail + 4]) && \valid[list] == 1) && #memory_$Pointer$[#memory_$Pointer$[list][list + 4]][0] == list) && #memory_$Pointer$[n][n] == list) && (\exists ULTIMATE.start_main_~tail~0.offset : int :: n == #memory_$Pointer$[list][ULTIMATE.start_main_~tail~0.offset + 4] && ((n == ULTIMATE.start_main_~tail~0.offset && n == list) || 0 == #memory_$Pointer$[n][n + 4]))) && !(x == 0)) || ((((((!(x == #memory_$Pointer$[list][list + 4]) && 0 == #memory_$Pointer$[list][list + 4]) && ((((#memory_$Pointer$[x][0] == 0 && (((((((n == #memory_$Pointer$[list][list + 4] && n == #memory_$Pointer$[list][list + 4]) && #memory_$Pointer$[n][n] == list) && ((!(x == #memory_$Pointer$[list][list + 4]) && x == list) || ((((0 == n && 0 == #memory_$Pointer$[n][n]) && x == list) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[list][4] == n))) && #memory_$Pointer$[n][n] == list) && 0 == #memory_$Pointer$[n][n + 4]) && (n == list || 0 == #memory_$Pointer$[n][n + 4])) || (#memory_$Pointer$[list][list + 4] == 0 && ((!(x == #memory_$Pointer$[list][list + 4]) && x == list) || ((((0 == n && 0 == #memory_$Pointer$[n][n]) && x == list) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[list][4] == n))))) && !(x == #memory_$Pointer$[x][0])) && 0 == tail) || ((((((n == list || 0 == #memory_$Pointer$[n][n]) && (((((((n == #memory_$Pointer$[list][list + 4] && n == #memory_$Pointer$[list][list + 4]) && #memory_$Pointer$[n][n] == list) && ((!(x == #memory_$Pointer$[list][list + 4]) && x == list) || ((((0 == n && 0 == #memory_$Pointer$[n][n]) && x == list) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[list][4] == n))) && #memory_$Pointer$[n][n] == list) && 0 == #memory_$Pointer$[n][n + 4]) && (n == list || 0 == #memory_$Pointer$[n][n + 4])) || (#memory_$Pointer$[list][list + 4] == 0 && ((!(x == #memory_$Pointer$[list][list + 4]) && x == list) || ((((0 == n && 0 == #memory_$Pointer$[n][n]) && x == list) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[list][4] == n))))) && n == list) && #memory_$Pointer$[n][n] == list) && (\exists ULTIMATE.start_main_~tail~0.offset : int :: n == #memory_$Pointer$[list][ULTIMATE.start_main_~tail~0.offset + 4] && ((n == ULTIMATE.start_main_~tail~0.offset && n == list) || 0 == #memory_$Pointer$[n][n + 4]))) && 0 == tail))) && 0 == list) && x == list) && \valid[x] == 1) && !(x == 0))) && list == tail) && unknown-#StackHeapBarrier-unknown < list [2019-12-07 17:27:35,512 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a0f88320-c836-467a-a4a9-3d60e0a1beac/bin/uautomizer/witness.graphml [2019-12-07 17:27:35,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:27:35,513 INFO L168 Benchmark]: Toolchain (without parser) took 338817.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 938.1 MB in the beginning and 808.5 MB in the end (delta: 129.6 MB). Peak memory consumption was 265.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:27:35,513 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:27:35,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -140.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:27:35,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:27:35,514 INFO L168 Benchmark]: Boogie Preprocessor took 21.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:27:35,514 INFO L168 Benchmark]: RCFGBuilder took 252.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:27:35,514 INFO L168 Benchmark]: TraceAbstraction took 338151.04 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 36.2 MB). Free memory was 1.0 GB in the beginning and 817.4 MB in the end (delta: 228.2 MB). Peak memory consumption was 286.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:27:35,514 INFO L168 Benchmark]: Witness Printer took 43.75 ms. Allocated memory is still 1.2 GB. Free memory was 817.4 MB in the beginning and 808.5 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:27:35,515 INFO L335 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 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -140.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 252.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 338151.04 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 36.2 MB). Free memory was 1.0 GB in the beginning and 817.4 MB in the end (delta: 228.2 MB). Peak memory consumption was 286.7 MB. Max. memory is 11.5 GB. * Witness Printer took 43.75 ms. Allocated memory is still 1.2 GB. Free memory was 817.4 MB in the beginning and 808.5 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 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$.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$.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$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] - 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$.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$.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$.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$.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$.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$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] - 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$.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$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] - 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$.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$.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$.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$.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$.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$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] - 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$.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$.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$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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 #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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 - 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 2 specifications checked. All of them hold - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 593]: Loop Invariant [2019-12-07 17:27:35,521 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,522 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,522 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,522 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,522 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,522 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,523 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,523 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,523 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,523 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,523 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,523 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-12-07 17:27:35,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-12-07 17:27:35,524 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,524 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,524 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,524 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,525 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,525 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,525 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,525 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,525 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,526 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,526 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,526 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,526 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,526 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,527 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,527 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,527 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,527 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,527 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,528 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,528 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,528 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,528 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,528 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,528 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,529 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,529 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,529 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,529 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,529 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,529 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,529 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,530 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,530 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,530 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,530 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,531 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,532 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,532 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-12-07 17:27:35,532 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-12-07 17:27:35,532 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,536 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,536 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,536 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,536 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,536 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,536 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,536 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,536 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,536 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,537 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,537 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,537 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,537 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,537 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,537 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,537 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,537 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,538 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,538 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,538 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,538 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,538 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,541 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,542 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,542 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,542 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-12-07 17:27:35,543 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,543 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,543 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,544 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,544 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,544 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,544 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,544 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,545 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,545 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,545 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,545 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,545 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-12-07 17:27:35,545 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-12-07 17:27:35,546 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,546 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,546 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,546 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,546 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,546 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,547 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,547 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,547 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,547 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,548 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,548 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,548 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,548 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,548 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,549 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,549 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,549 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,549 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,549 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,550 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,550 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,550 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,550 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,550 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,551 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,551 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,551 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,551 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,552 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,552 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,552 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,552 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,552 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,553 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,553 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,553 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,553 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-12-07 17:27:35,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-12-07 17:27:35,554 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,555 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,555 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,555 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,556 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,556 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,556 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,556 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,556 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,556 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,557 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,557 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,557 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,557 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,557 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,557 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,557 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,558 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,558 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,558 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,558 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,559 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,559 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,559 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,559 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,559 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,559 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,560 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,560 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,560 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,560 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,560 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,561 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,561 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,561 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,561 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,561 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,562 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,562 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,562 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,562 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,563 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,563 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,563 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,563 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,563 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,565 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((((((((((((((((((((#memory_$Pointer$[x][0] == list && #memory_$Pointer$[x][0] == 0) && 0 == list) && x == list) && #memory_$Pointer$[list][list + 4] + 2 <= list) && \valid[x] == 1) && 0 == #memory_$Pointer$[n][n + 4]) && !(0 == #memory_$Pointer$[x][0])) && 0 == tail) && n == #memory_$Pointer$[list][4]) && 1 == \valid[n]) && x + 2 <= list) && 0 == #memory_$Pointer$[list][list + 4]) && !(n == 0)) && n == #memory_$Pointer$[tail][tail + 4]) && \valid[list] == 1) && #memory_$Pointer$[#memory_$Pointer$[list][list + 4]][0] == list) && #memory_$Pointer$[n][n] == list) && (\exists ULTIMATE.start_main_~tail~0.offset : int :: n == #memory_$Pointer$[list][ULTIMATE.start_main_~tail~0.offset + 4] && ((n == ULTIMATE.start_main_~tail~0.offset && n == list) || 0 == #memory_$Pointer$[n][n + 4]))) && !(x == 0)) || ((((((!(x == #memory_$Pointer$[list][list + 4]) && 0 == #memory_$Pointer$[list][list + 4]) && ((((#memory_$Pointer$[x][0] == 0 && (((((((n == #memory_$Pointer$[list][list + 4] && n == #memory_$Pointer$[list][list + 4]) && #memory_$Pointer$[n][n] == list) && ((!(x == #memory_$Pointer$[list][list + 4]) && x == list) || ((((0 == n && 0 == #memory_$Pointer$[n][n]) && x == list) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[list][4] == n))) && #memory_$Pointer$[n][n] == list) && 0 == #memory_$Pointer$[n][n + 4]) && (n == list || 0 == #memory_$Pointer$[n][n + 4])) || (#memory_$Pointer$[list][list + 4] == 0 && ((!(x == #memory_$Pointer$[list][list + 4]) && x == list) || ((((0 == n && 0 == #memory_$Pointer$[n][n]) && x == list) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[list][4] == n))))) && !(x == #memory_$Pointer$[x][0])) && 0 == tail) || ((((((n == list || 0 == #memory_$Pointer$[n][n]) && (((((((n == #memory_$Pointer$[list][list + 4] && n == #memory_$Pointer$[list][list + 4]) && #memory_$Pointer$[n][n] == list) && ((!(x == #memory_$Pointer$[list][list + 4]) && x == list) || ((((0 == n && 0 == #memory_$Pointer$[n][n]) && x == list) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[list][4] == n))) && #memory_$Pointer$[n][n] == list) && 0 == #memory_$Pointer$[n][n + 4]) && (n == list || 0 == #memory_$Pointer$[n][n + 4])) || (#memory_$Pointer$[list][list + 4] == 0 && ((!(x == #memory_$Pointer$[list][list + 4]) && x == list) || ((((0 == n && 0 == #memory_$Pointer$[n][n]) && x == list) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[list][4] == n))))) && n == list) && #memory_$Pointer$[n][n] == list) && (\exists ULTIMATE.start_main_~tail~0.offset : int :: n == #memory_$Pointer$[list][ULTIMATE.start_main_~tail~0.offset + 4] && ((n == ULTIMATE.start_main_~tail~0.offset && n == list) || 0 == #memory_$Pointer$[n][n + 4]))) && 0 == tail))) && 0 == list) && x == list) && \valid[x] == 1) && !(x == 0))) && list == tail) && unknown-#StackHeapBarrier-unknown < list - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant [2019-12-07 17:27:35,566 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,566 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,566 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,566 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,567 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,567 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,567 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,567 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,567 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,567 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,568 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,568 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,568 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-12-07 17:27:35,568 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,568 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-12-07 17:27:35,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,570 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,570 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,570 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,570 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,570 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,571 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,571 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,571 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,571 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,572 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,572 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,572 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,572 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,572 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,572 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,572 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 17:27:35,573 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 17:27:35,573 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-12-07 17:27:35,573 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,573 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,574 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-12-07 17:27:35,574 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,574 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,574 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,574 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,574 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,575 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,575 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,575 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,575 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 17:27:35,575 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((!(0 == cond) && list == tail) && \valid[list] == 1) && x == list) && list == tail) && x == list) && unknown-#StackHeapBarrier-unknown < list) || ((((((((((((((((((((((((!(0 == cond) && n + 2 <= list) && n == list) && 0 == #memory_$Pointer$[n][n]) && list == tail) && #memory_$Pointer$[x][x] == list) && 1 == \valid[n]) && x + 2 <= list) && x == 0) && list == tail) && x == x) && x == 0) && \valid[x] == 1) && unknown-#StackHeapBarrier-unknown < list) && #memory_$Pointer$[#memory_$Pointer$[x][x]][list + 4] == 0) && list == #memory_$Pointer$[x][x]) && #memory_$Pointer$[x][x + 4] == 0) && !(#memory_$Pointer$[x][x] == 0)) && !(n == 0)) && 0 == #memory_$Pointer$[#memory_$Pointer$[x][x]][list + 4]) && \valid[list] == 1) && #memory_$Pointer$[n][n] == list) && list == #memory_$Pointer$[list][list + 4]) && #memory_$Pointer$[x][4] == 0) && !(x == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 2 error locations. Result: SAFE, OverallTime: 274.9s, OverallIterations: 23, TraceHistogramMax: 6, AutomataDifference: 235.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 63.1s, HoareTripleCheckerStatistics: 983 SDtfs, 2725 SDslu, 6110 SDs, 0 SdLazy, 7445 SolverSat, 1208 SolverUnsat, 73 SolverUnknown, 0 SolverNotchecked, 155.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1318 GetRequests, 602 SyntacticMatches, 81 SemanticMatches, 635 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8284 ImplicationChecksByTransitivity, 103.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 553 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 195 PreInvPairs, 215 NumberOfFragments, 1797 HoareAnnotationTreeSize, 195 FomulaSimplifications, 2770530 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 9 FomulaSimplificationsInter, 189104 FormulaSimplificationTreeSizeReductionInter, 62.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 34.9s InterpolantComputationTime, 1521 NumberOfCodeBlocks, 1518 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1484 ConstructedInterpolants, 246 QuantifiedInterpolants, 2462061 SizeOfPredicates, 267 NumberOfNonLiveVariables, 3150 ConjunctsInSsa, 704 ConjunctsInUnsatCore, 37 InterpolantComputations, 9 PerfectInterpolantSequences, 705/1142 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...