./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fabf658906da38258bbb10e77b5550f740cea929 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 14:28:35,506 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 14:28:35,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 14:28:35,512 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 14:28:35,512 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 14:28:35,513 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 14:28:35,513 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 14:28:35,514 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 14:28:35,515 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 14:28:35,515 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 14:28:35,516 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 14:28:35,516 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 14:28:35,516 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 14:28:35,517 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 14:28:35,517 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 14:28:35,518 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 14:28:35,518 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 14:28:35,519 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 14:28:35,520 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 14:28:35,520 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 14:28:35,521 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 14:28:35,521 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 14:28:35,522 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 14:28:35,522 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 14:28:35,523 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 14:28:35,523 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 14:28:35,523 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 14:28:35,524 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 14:28:35,524 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 14:28:35,525 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 14:28:35,525 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 14:28:35,525 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 14:28:35,525 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 14:28:35,525 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 14:28:35,526 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 14:28:35,526 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 14:28:35,526 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 14:28:35,533 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 14:28:35,533 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 14:28:35,533 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 14:28:35,533 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 14:28:35,534 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 14:28:35,534 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 14:28:35,534 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 14:28:35,534 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 14:28:35,534 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 14:28:35,534 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 14:28:35,534 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 14:28:35,534 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 14:28:35,535 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 14:28:35,535 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 14:28:35,535 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 14:28:35,535 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 14:28:35,535 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 14:28:35,535 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 14:28:35,535 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 14:28:35,535 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 14:28:35,535 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 14:28:35,535 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 14:28:35,535 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 14:28:35,535 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 14:28:35,536 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 14:28:35,536 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 14:28:35,536 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 14:28:35,536 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 14:28:35,536 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 14:28:35,536 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 14:28:35,536 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fabf658906da38258bbb10e77b5550f740cea929 [2018-12-08 14:28:35,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 14:28:35,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 14:28:35,561 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 14:28:35,562 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 14:28:35,562 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 14:28:35,563 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 14:28:35,596 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/data/bb37d5e78/d9928e9762e94bbb86fb480fcadb8f46/FLAG45dde1d2b [2018-12-08 14:28:36,015 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 14:28:36,015 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 14:28:36,022 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/data/bb37d5e78/d9928e9762e94bbb86fb480fcadb8f46/FLAG45dde1d2b [2018-12-08 14:28:36,032 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/data/bb37d5e78/d9928e9762e94bbb86fb480fcadb8f46 [2018-12-08 14:28:36,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 14:28:36,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 14:28:36,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 14:28:36,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 14:28:36,037 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 14:28:36,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:28:36" (1/1) ... [2018-12-08 14:28:36,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@665b4d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:28:36, skipping insertion in model container [2018-12-08 14:28:36,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:28:36" (1/1) ... [2018-12-08 14:28:36,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 14:28:36,062 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 14:28:36,211 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:28:36,217 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 14:28:36,283 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:28:36,307 INFO L195 MainTranslator]: Completed translation [2018-12-08 14:28:36,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:28:36 WrapperNode [2018-12-08 14:28:36,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 14:28:36,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 14:28:36,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 14:28:36,309 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 14:28:36,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:28:36" (1/1) ... [2018-12-08 14:28:36,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:28:36" (1/1) ... [2018-12-08 14:28:36,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 14:28:36,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 14:28:36,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 14:28:36,330 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 14:28:36,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:28:36" (1/1) ... [2018-12-08 14:28:36,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:28:36" (1/1) ... [2018-12-08 14:28:36,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:28:36" (1/1) ... [2018-12-08 14:28:36,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:28:36" (1/1) ... [2018-12-08 14:28:36,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:28:36" (1/1) ... [2018-12-08 14:28:36,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:28:36" (1/1) ... [2018-12-08 14:28:36,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:28:36" (1/1) ... [2018-12-08 14:28:36,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 14:28:36,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 14:28:36,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 14:28:36,350 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 14:28:36,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:28:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 14:28:36,384 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-08 14:28:36,384 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-08 14:28:36,384 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-08 14:28:36,384 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-08 14:28:36,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 14:28:36,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 14:28:36,384 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2018-12-08 14:28:36,384 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2018-12-08 14:28:36,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 14:28:36,384 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2018-12-08 14:28:36,384 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2018-12-08 14:28:36,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 14:28:36,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 14:28:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 14:28:36,385 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 14:28:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 14:28:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 14:28:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 14:28:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-08 14:28:36,385 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-08 14:28:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 14:28:36,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 14:28:36,591 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 14:28:36,591 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-08 14:28:36,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:28:36 BoogieIcfgContainer [2018-12-08 14:28:36,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 14:28:36,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 14:28:36,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 14:28:36,594 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 14:28:36,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 02:28:36" (1/3) ... [2018-12-08 14:28:36,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3023548e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 02:28:36, skipping insertion in model container [2018-12-08 14:28:36,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:28:36" (2/3) ... [2018-12-08 14:28:36,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3023548e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 02:28:36, skipping insertion in model container [2018-12-08 14:28:36,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:28:36" (3/3) ... [2018-12-08 14:28:36,596 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 14:28:36,601 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 14:28:36,606 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 14:28:36,614 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 14:28:36,630 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 14:28:36,631 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 14:28:36,631 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 14:28:36,631 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 14:28:36,631 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 14:28:36,631 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 14:28:36,631 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 14:28:36,631 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 14:28:36,631 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 14:28:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-12-08 14:28:36,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 14:28:36,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:28:36,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:28:36,648 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:28:36,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:28:36,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2123187409, now seen corresponding path program 1 times [2018-12-08 14:28:36,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:28:36,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:28:36,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:36,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:28:36,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:28:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:28:36,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:28:36,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 14:28:36,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 14:28:36,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 14:28:36,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 14:28:36,776 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 5 states. [2018-12-08 14:28:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:28:36,827 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2018-12-08 14:28:36,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 14:28:36,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-08 14:28:36,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:28:36,833 INFO L225 Difference]: With dead ends: 95 [2018-12-08 14:28:36,834 INFO L226 Difference]: Without dead ends: 43 [2018-12-08 14:28:36,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:28:36,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-08 14:28:36,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-12-08 14:28:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-08 14:28:36,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-12-08 14:28:36,858 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2018-12-08 14:28:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:28:36,859 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-12-08 14:28:36,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 14:28:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-12-08 14:28:36,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 14:28:36,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:28:36,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:28:36,860 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:28:36,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:28:36,860 INFO L82 PathProgramCache]: Analyzing trace with hash -287578872, now seen corresponding path program 1 times [2018-12-08 14:28:36,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:28:36,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:28:36,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:36,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:28:36,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:28:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:28:36,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:28:36,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 14:28:36,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:28:36,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:28:36,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:28:36,897 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 3 states. [2018-12-08 14:28:36,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:28:36,911 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-12-08 14:28:36,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:28:36,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 14:28:36,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:28:36,912 INFO L225 Difference]: With dead ends: 73 [2018-12-08 14:28:36,912 INFO L226 Difference]: Without dead ends: 43 [2018-12-08 14:28:36,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:28:36,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-08 14:28:36,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-12-08 14:28:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-08 14:28:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-08 14:28:36,916 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 30 [2018-12-08 14:28:36,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:28:36,916 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-08 14:28:36,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:28:36,917 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-08 14:28:36,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 14:28:36,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:28:36,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:28:36,917 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:28:36,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:28:36,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1976522614, now seen corresponding path program 1 times [2018-12-08 14:28:36,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:28:36,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:28:36,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:36,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:28:36,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:28:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:28:36,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:28:36,954 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:28:36,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:28:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:28:36,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:28:37,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:28:37,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:28:37,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-08 14:28:37,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 14:28:37,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 14:28:37,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:28:37,015 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 6 states. [2018-12-08 14:28:37,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:28:37,050 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-12-08 14:28:37,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 14:28:37,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-12-08 14:28:37,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:28:37,051 INFO L225 Difference]: With dead ends: 73 [2018-12-08 14:28:37,051 INFO L226 Difference]: Without dead ends: 48 [2018-12-08 14:28:37,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 14:28:37,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-08 14:28:37,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-12-08 14:28:37,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-08 14:28:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-08 14:28:37,057 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 30 [2018-12-08 14:28:37,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:28:37,057 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-08 14:28:37,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 14:28:37,057 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-08 14:28:37,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 14:28:37,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:28:37,058 INFO L402 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:28:37,058 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:28:37,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:28:37,059 INFO L82 PathProgramCache]: Analyzing trace with hash -602728307, now seen corresponding path program 1 times [2018-12-08 14:28:37,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:28:37,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:28:37,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:37,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:28:37,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:28:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 14:28:37,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:28:37,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 14:28:37,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 14:28:37,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 14:28:37,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 14:28:37,108 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 4 states. [2018-12-08 14:28:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:28:37,133 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-12-08 14:28:37,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 14:28:37,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-08 14:28:37,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:28:37,134 INFO L225 Difference]: With dead ends: 67 [2018-12-08 14:28:37,134 INFO L226 Difference]: Without dead ends: 54 [2018-12-08 14:28:37,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 14:28:37,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-08 14:28:37,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-12-08 14:28:37,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-08 14:28:37,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-08 14:28:37,141 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 35 [2018-12-08 14:28:37,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:28:37,141 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-08 14:28:37,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 14:28:37,142 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-08 14:28:37,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 14:28:37,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:28:37,142 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:28:37,142 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:28:37,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:28:37,143 INFO L82 PathProgramCache]: Analyzing trace with hash -985974537, now seen corresponding path program 1 times [2018-12-08 14:28:37,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:28:37,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:28:37,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:37,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:28:37,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:28:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 14:28:37,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:28:37,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:28:37,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:28:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:28:37,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:28:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 14:28:37,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:28:37,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-08 14:28:37,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 14:28:37,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 14:28:37,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 14:28:37,259 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 7 states. [2018-12-08 14:28:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:28:37,310 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2018-12-08 14:28:37,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 14:28:37,310 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-12-08 14:28:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:28:37,311 INFO L225 Difference]: With dead ends: 77 [2018-12-08 14:28:37,311 INFO L226 Difference]: Without dead ends: 64 [2018-12-08 14:28:37,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-08 14:28:37,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-08 14:28:37,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2018-12-08 14:28:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-08 14:28:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-12-08 14:28:37,318 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 43 [2018-12-08 14:28:37,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:28:37,319 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-12-08 14:28:37,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 14:28:37,319 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-12-08 14:28:37,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 14:28:37,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:28:37,321 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:28:37,321 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:28:37,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:28:37,321 INFO L82 PathProgramCache]: Analyzing trace with hash -124170399, now seen corresponding path program 2 times [2018-12-08 14:28:37,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:28:37,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:28:37,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:37,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:28:37,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:28:37,383 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 14:28:37,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:28:37,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:28:37,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 14:28:37,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 14:28:37,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 14:28:37,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:28:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 14:28:37,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 14:28:37,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-12-08 14:28:37,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 14:28:37,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 14:28:37,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-08 14:28:37,468 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2018-12-08 14:28:37,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:28:37,572 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2018-12-08 14:28:37,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 14:28:37,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-12-08 14:28:37,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:28:37,574 INFO L225 Difference]: With dead ends: 81 [2018-12-08 14:28:37,574 INFO L226 Difference]: Without dead ends: 60 [2018-12-08 14:28:37,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-12-08 14:28:37,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-08 14:28:37,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-12-08 14:28:37,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-08 14:28:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-12-08 14:28:37,579 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 51 [2018-12-08 14:28:37,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:28:37,579 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-12-08 14:28:37,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 14:28:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-12-08 14:28:37,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 14:28:37,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:28:37,580 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:28:37,580 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:28:37,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:28:37,580 INFO L82 PathProgramCache]: Analyzing trace with hash 850280592, now seen corresponding path program 1 times [2018-12-08 14:28:37,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:28:37,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:28:37,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:37,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:28:37,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:28:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:28:38,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:28:38,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:28:38,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:28:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:28:38,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:28:38,250 INFO L478 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 [2018-12-08 14:28:38,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:38,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:38,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 14:28:38,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:28:38,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:28:38,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 14:28:38,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:38,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:38,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 14:28:38,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-08 14:28:38,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-08 14:28:38,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:28:38,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-08 14:28:38,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:38,291 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:38,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:38,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:38,298 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-12-08 14:28:38,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-12-08 14:28:38,339 INFO L478 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 16 treesize of output 15 [2018-12-08 14:28:38,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:38,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:38,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:38,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-08 14:28:38,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 14:28:38,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 14:28:38,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:38,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:38,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:38,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-08 14:28:38,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-12-08 14:28:38,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:28:38,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:28:38,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-12-08 14:28:38,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:38,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:38,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:38,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:45 [2018-12-08 14:28:39,212 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int) (dll_update_at_~data Int)) (= |c_#memory_int| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) (+ |c_dll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) dll_update_at_~head.offset dll_update_at_~data))))) is different from true [2018-12-08 14:28:39,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-12-08 14:28:39,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:28:39,221 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:28:39,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-12-08 14:28:39,223 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:39,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 14:28:39,230 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:39,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:39,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-08 14:28:39,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 14:28:39,243 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:39,246 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:39,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:39,252 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:68, output treesize:17 [2018-12-08 14:28:39,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-12-08 14:28:39,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-08 14:28:39,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:39,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 14:28:39,491 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:39,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:39,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:39,496 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:10 [2018-12-08 14:28:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-08 14:28:39,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:28:39,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 52 [2018-12-08 14:28:39,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-08 14:28:39,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-08 14:28:39,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2396, Unknown=1, NotChecked=98, Total=2652 [2018-12-08 14:28:39,546 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 52 states. [2018-12-08 14:28:46,087 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2018-12-08 14:28:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:28:49,975 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2018-12-08 14:28:49,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-08 14:28:49,976 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-08 14:28:49,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:28:49,977 INFO L225 Difference]: With dead ends: 143 [2018-12-08 14:28:49,977 INFO L226 Difference]: Without dead ends: 140 [2018-12-08 14:28:49,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2316 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=668, Invalid=8438, Unknown=18, NotChecked=188, Total=9312 [2018-12-08 14:28:49,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-08 14:28:49,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 86. [2018-12-08 14:28:49,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-08 14:28:49,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2018-12-08 14:28:49,995 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 52 [2018-12-08 14:28:49,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:28:49,995 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2018-12-08 14:28:49,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-08 14:28:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2018-12-08 14:28:49,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 14:28:49,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:28:49,996 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:28:49,997 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:28:49,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:28:49,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1372027452, now seen corresponding path program 1 times [2018-12-08 14:28:49,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:28:49,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:28:49,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:49,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:28:49,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:28:50,041 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 14:28:50,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:28:50,041 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:28:50,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:28:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:28:50,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:28:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 14:28:50,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:28:50,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-08 14:28:50,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 14:28:50,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 14:28:50,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 14:28:50,105 INFO L87 Difference]: Start difference. First operand 86 states and 110 transitions. Second operand 8 states. [2018-12-08 14:28:50,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:28:50,162 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2018-12-08 14:28:50,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 14:28:50,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-12-08 14:28:50,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:28:50,164 INFO L225 Difference]: With dead ends: 109 [2018-12-08 14:28:50,164 INFO L226 Difference]: Without dead ends: 93 [2018-12-08 14:28:50,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-08 14:28:50,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-08 14:28:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2018-12-08 14:28:50,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-08 14:28:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2018-12-08 14:28:50,173 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 53 [2018-12-08 14:28:50,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:28:50,174 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2018-12-08 14:28:50,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 14:28:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2018-12-08 14:28:50,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 14:28:50,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:28:50,175 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:28:50,175 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:28:50,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:28:50,175 INFO L82 PathProgramCache]: Analyzing trace with hash 993490241, now seen corresponding path program 2 times [2018-12-08 14:28:50,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:28:50,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:28:50,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:50,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:28:50,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:28:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 14:28:50,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:28:50,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:28:50,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 14:28:50,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 14:28:50,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 14:28:50,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:28:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 14:28:50,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:28:50,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-08 14:28:50,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 14:28:50,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 14:28:50,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 14:28:50,257 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand 8 states. [2018-12-08 14:28:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:28:50,335 INFO L93 Difference]: Finished difference Result 131 states and 161 transitions. [2018-12-08 14:28:50,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 14:28:50,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-12-08 14:28:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:28:50,336 INFO L225 Difference]: With dead ends: 131 [2018-12-08 14:28:50,336 INFO L226 Difference]: Without dead ends: 90 [2018-12-08 14:28:50,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-08 14:28:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-08 14:28:50,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2018-12-08 14:28:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-08 14:28:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2018-12-08 14:28:50,343 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 53 [2018-12-08 14:28:50,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:28:50,344 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2018-12-08 14:28:50,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 14:28:50,344 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2018-12-08 14:28:50,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 14:28:50,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:28:50,345 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:28:50,345 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:28:50,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:28:50,345 INFO L82 PathProgramCache]: Analyzing trace with hash -726983891, now seen corresponding path program 3 times [2018-12-08 14:28:50,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:28:50,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:28:50,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:50,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:28:50,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:28:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 14:28:50,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:28:50,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:28:50,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 14:28:50,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-08 14:28:50,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 14:28:50,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:28:50,484 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 14:28:50,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:28:50,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-08 14:28:50,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 14:28:50,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 14:28:50,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 14:28:50,500 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand 8 states. [2018-12-08 14:28:50,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:28:50,540 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2018-12-08 14:28:50,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 14:28:50,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-12-08 14:28:50,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:28:50,541 INFO L225 Difference]: With dead ends: 120 [2018-12-08 14:28:50,541 INFO L226 Difference]: Without dead ends: 87 [2018-12-08 14:28:50,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-08 14:28:50,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-08 14:28:50,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2018-12-08 14:28:50,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-08 14:28:50,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2018-12-08 14:28:50,551 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 53 [2018-12-08 14:28:50,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:28:50,551 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2018-12-08 14:28:50,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 14:28:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2018-12-08 14:28:50,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-08 14:28:50,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:28:50,552 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 14:28:50,553 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:28:50,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:28:50,553 INFO L82 PathProgramCache]: Analyzing trace with hash 949466391, now seen corresponding path program 4 times [2018-12-08 14:28:50,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:28:50,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:28:50,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:50,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:28:50,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:28:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 14:28:50,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:28:50,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:28:50,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-08 14:28:50,633 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-08 14:28:50,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 14:28:50,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:28:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 14:28:50,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 14:28:50,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2018-12-08 14:28:50,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 14:28:50,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 14:28:50,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-08 14:28:50,671 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand 10 states. [2018-12-08 14:28:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:28:50,726 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2018-12-08 14:28:50,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 14:28:50,726 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-12-08 14:28:50,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:28:50,727 INFO L225 Difference]: With dead ends: 116 [2018-12-08 14:28:50,727 INFO L226 Difference]: Without dead ends: 77 [2018-12-08 14:28:50,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-08 14:28:50,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-08 14:28:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2018-12-08 14:28:50,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-08 14:28:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-12-08 14:28:50,733 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 61 [2018-12-08 14:28:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:28:50,733 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-12-08 14:28:50,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 14:28:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-12-08 14:28:50,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 14:28:50,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:28:50,734 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:28:50,734 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:28:50,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:28:50,734 INFO L82 PathProgramCache]: Analyzing trace with hash -554830821, now seen corresponding path program 1 times [2018-12-08 14:28:50,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:28:50,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:28:50,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:50,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:28:50,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:28:50,767 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-08 14:28:50,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:28:50,767 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:28:50,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:28:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:28:50,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:28:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-08 14:28:50,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 14:28:50,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-12-08 14:28:50,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 14:28:50,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 14:28:50,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 14:28:50,820 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 7 states. [2018-12-08 14:28:50,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:28:50,858 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-12-08 14:28:50,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 14:28:50,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-12-08 14:28:50,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:28:50,858 INFO L225 Difference]: With dead ends: 72 [2018-12-08 14:28:50,858 INFO L226 Difference]: Without dead ends: 64 [2018-12-08 14:28:50,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 14:28:50,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-08 14:28:50,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-08 14:28:50,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-08 14:28:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-12-08 14:28:50,865 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 62 [2018-12-08 14:28:50,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:28:50,865 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-12-08 14:28:50,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 14:28:50,865 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-12-08 14:28:50,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 14:28:50,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:28:50,866 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:28:50,866 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:28:50,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:28:50,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1980808295, now seen corresponding path program 1 times [2018-12-08 14:28:50,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:28:50,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:28:50,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:50,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:28:50,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:28:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:28:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 14:28:51,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:28:51,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:28:51,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:28:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:28:51,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:28:51,428 INFO L478 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 [2018-12-08 14:28:51,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:51,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:51,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 14:28:51,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:28:51,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:28:51,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 14:28:51,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:51,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:51,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-08 14:28:51,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-08 14:28:51,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-08 14:28:51,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:28:51,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-08 14:28:51,494 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:51,497 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:51,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:51,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:51,502 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:23, output treesize:23 [2018-12-08 14:28:51,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-12-08 14:28:51,532 INFO L478 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 16 treesize of output 15 [2018-12-08 14:28:51,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:51,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:51,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:51,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:35 [2018-12-08 14:28:51,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-08 14:28:51,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-08 14:28:51,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:51,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:51,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:51,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:19 [2018-12-08 14:28:52,822 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int)) (and (<= dll_update_at_~head.offset |c_dll_update_at_#in~head.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset)))))) is different from true [2018-12-08 14:28:52,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-12-08 14:28:52,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:28:52,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:28:52,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:28:52,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-12-08 14:28:52,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:52,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:52,852 INFO L267 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. [2018-12-08 14:28:52,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:41 [2018-12-08 14:28:53,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-12-08 14:28:53,027 INFO L478 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 20 treesize of output 19 [2018-12-08 14:28:53,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:53,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:53,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:53,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-12-08 14:28:53,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 113 [2018-12-08 14:28:53,095 INFO L478 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 36 treesize of output 1 [2018-12-08 14:28:53,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:53,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:53,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 87 [2018-12-08 14:28:53,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 27 [2018-12-08 14:28:53,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 14:28:53,130 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 14:28:53,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 14:28:53,144 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:149, output treesize:104 [2018-12-08 14:28:53,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 90 [2018-12-08 14:28:53,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:28:53,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 79 [2018-12-08 14:28:53,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:53,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:28:53,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:28:53,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 100 [2018-12-08 14:28:53,692 INFO L267 ElimStorePlain]: Start of recursive call 4: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-12-08 14:28:53,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:28:53,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 60 [2018-12-08 14:28:53,766 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:53,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 6 xjuncts. [2018-12-08 14:28:53,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 66 [2018-12-08 14:28:53,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-12-08 14:28:53,887 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:53,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2018-12-08 14:28:53,907 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:53,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:28:53,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2018-12-08 14:28:53,931 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:53,949 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 14:28:53,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 66 [2018-12-08 14:28:53,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-12-08 14:28:53,957 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:53,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:28:53,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2018-12-08 14:28:53,983 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:54,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-12-08 14:28:54,002 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:54,021 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 14:28:54,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 74 [2018-12-08 14:28:54,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2018-12-08 14:28:54,029 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:54,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-12-08 14:28:54,052 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:54,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:28:54,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2018-12-08 14:28:54,076 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:54,098 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 14:28:54,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-12-08 14:28:54,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-08 14:28:54,103 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:54,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-08 14:28:54,110 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:54,116 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:54,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 66 [2018-12-08 14:28:54,129 INFO L478 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 58 treesize of output 58 [2018-12-08 14:28:54,130 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 14:28:54,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-12-08 14:28:54,158 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:54,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-12-08 14:28:54,187 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:54,212 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-08 14:28:54,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 50 [2018-12-08 14:28:54,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-12-08 14:28:54,219 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:54,242 INFO L478 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 42 treesize of output 42 [2018-12-08 14:28:54,243 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 14:28:54,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-12-08 14:28:54,261 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:28:54,278 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-08 14:28:54,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-08 14:28:54,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-08 14:28:54,426 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,436 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,438 INFO L478 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 34 treesize of output 28 [2018-12-08 14:28:54,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-08 14:28:54,442 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,446 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-08 14:28:54,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 14:28:54,448 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,451 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,453 INFO L478 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 38 treesize of output 32 [2018-12-08 14:28:54,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-08 14:28:54,455 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,459 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-12-08 14:28:54,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 14:28:54,462 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,469 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 60 [2018-12-08 14:28:54,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-12-08 14:28:54,478 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-12-08 14:28:54,506 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2018-12-08 14:28:54,528 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,540 INFO L267 ElimStorePlain]: Start of recursive call 39: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2018-12-08 14:28:54,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-12-08 14:28:54,547 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-08 14:28:54,561 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-12-08 14:28:54,575 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,583 INFO L267 ElimStorePlain]: Start of recursive call 43: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 56 [2018-12-08 14:28:54,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2018-12-08 14:28:54,591 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,614 INFO L267 ElimStorePlain]: Start of recursive call 47: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 48 [2018-12-08 14:28:54,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-12-08 14:28:54,622 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-12-08 14:28:54,642 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,656 INFO L267 ElimStorePlain]: Start of recursive call 49: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-12-08 14:28:54,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-08 14:28:54,660 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,666 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 48 [2018-12-08 14:28:54,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-12-08 14:28:54,673 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-12-08 14:28:54,696 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-12-08 14:28:54,712 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,722 INFO L267 ElimStorePlain]: Start of recursive call 54: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 52 [2018-12-08 14:28:54,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2018-12-08 14:28:54,729 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,749 INFO L267 ElimStorePlain]: Start of recursive call 58: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 52 [2018-12-08 14:28:54,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-12-08 14:28:54,756 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2018-12-08 14:28:54,775 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2018-12-08 14:28:54,794 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,805 INFO L267 ElimStorePlain]: Start of recursive call 60: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:28:54,852 INFO L202 ElimStorePlain]: Needed 63 recursive calls to eliminate 7 variables, input treesize:99, output treesize:7 [2018-12-08 14:28:54,892 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-12-08 14:28:54,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:28:54,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30] total 54 [2018-12-08 14:28:54,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-08 14:28:54,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-08 14:28:54,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2601, Unknown=1, NotChecked=102, Total=2862 [2018-12-08 14:28:54,908 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 54 states. [2018-12-08 14:28:58,538 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-12-08 14:29:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:29:00,724 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2018-12-08 14:29:00,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-08 14:29:00,724 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 63 [2018-12-08 14:29:00,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:29:00,725 INFO L225 Difference]: With dead ends: 123 [2018-12-08 14:29:00,725 INFO L226 Difference]: Without dead ends: 111 [2018-12-08 14:29:00,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2093 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=674, Invalid=8639, Unknown=3, NotChecked=190, Total=9506 [2018-12-08 14:29:00,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-08 14:29:00,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 65. [2018-12-08 14:29:00,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-08 14:29:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-12-08 14:29:00,734 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 63 [2018-12-08 14:29:00,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:29:00,734 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-12-08 14:29:00,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-08 14:29:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-12-08 14:29:00,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 14:29:00,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:29:00,734 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:29:00,734 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:29:00,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:29:00,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1058530267, now seen corresponding path program 2 times [2018-12-08 14:29:00,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:29:00,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:29:00,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:29:00,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:29:00,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:29:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:29:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 14:29:00,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:29:00,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:29:00,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 14:29:00,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 14:29:00,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 14:29:00,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:29:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 14:29:00,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:29:00,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-08 14:29:00,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 14:29:00,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 14:29:00,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 14:29:00,832 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 7 states. [2018-12-08 14:29:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:29:00,867 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-12-08 14:29:00,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 14:29:00,867 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-12-08 14:29:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:29:00,868 INFO L225 Difference]: With dead ends: 65 [2018-12-08 14:29:00,868 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 14:29:00,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-08 14:29:00,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 14:29:00,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 14:29:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 14:29:00,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 14:29:00,869 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2018-12-08 14:29:00,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:29:00,869 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:29:00,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 14:29:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 14:29:00,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 14:29:00,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 14:29:00,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 14:29:01,098 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 46 [2018-12-08 14:29:01,267 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 45 [2018-12-08 14:29:01,595 INFO L444 ceAbstractionStarter]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse3 (= |#memory_int| |old(#memory_int)|)) (.cse2 (<= (+ dll_update_at_~index 1) |dll_update_at_#in~index|)) (.cse4 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (let ((.cse0 (and .cse3 .cse2 .cse4 (<= 2 |dll_update_at_#in~index|))) (.cse1 (+ |dll_update_at_#in~head.offset| 4)) (.cse6 (= dll_update_at_~data |dll_update_at_#in~data|)) (.cse7 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse5 (<= |dll_update_at_#in~index| dll_update_at_~index))) (and (or .cse0 (and (<= 1 |dll_update_at_#in~index|) (= dll_update_at_~head.base (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) .cse1)) .cse2 .cse3 .cse4) (and (= |dll_update_at_#in~head.base| dll_update_at_~head.base) (<= dll_update_at_~index |dll_update_at_#in~index|) .cse3 .cse5 .cse4 .cse6 .cse7 (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|))) (or .cse0 (and (= (select (select |#memory_$Pointer$.offset| |dll_update_at_#in~head.base|) .cse1) dll_update_at_~head.offset) .cse6 .cse7) .cse5)))) [2018-12-08 14:29:01,595 INFO L448 ceAbstractionStarter]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2018-12-08 14:29:01,596 INFO L444 ceAbstractionStarter]: At program point dll_update_atENTRY(lines 606 612) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-12-08 14:29:01,596 INFO L448 ceAbstractionStarter]: For program point dll_update_atEXIT(lines 606 612) no Hoare annotation was computed. [2018-12-08 14:29:01,596 INFO L448 ceAbstractionStarter]: For program point dll_update_atFINAL(lines 606 612) no Hoare annotation was computed. [2018-12-08 14:29:01,596 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-08 14:29:01,596 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-08 14:29:01,596 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 14:29:01,596 INFO L451 ceAbstractionStarter]: At program point myexitENTRY(lines 561 563) the Hoare annotation is: true [2018-12-08 14:29:01,596 INFO L448 ceAbstractionStarter]: For program point myexitFINAL(lines 561 563) no Hoare annotation was computed. [2018-12-08 14:29:01,596 INFO L448 ceAbstractionStarter]: For program point myexitEXIT(lines 561 563) no Hoare annotation was computed. [2018-12-08 14:29:01,596 INFO L451 ceAbstractionStarter]: At program point L562(line 562) the Hoare annotation is: true [2018-12-08 14:29:01,596 INFO L448 ceAbstractionStarter]: For program point L578-1(lines 578 580) no Hoare annotation was computed. [2018-12-08 14:29:01,596 INFO L444 ceAbstractionStarter]: At program point dll_createENTRY(lines 574 591) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-12-08 14:29:01,596 INFO L444 ceAbstractionStarter]: At program point L576-2(lines 576 589) the Hoare annotation is: (let ((.cse3 (= dll_create_~head~0.offset 0)) (.cse0 (= (select |#valid| dll_create_~head~0.base) 1)) (.cse1 (= (select |#valid| dll_create_~new_head~0.base) 1)) (.cse2 (= 0 dll_create_~new_head~0.offset))) (or (and .cse0 (not (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~new_head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (+ 0 4)) dll_create_~head~0.base)) .cse1 (= 0 dll_create_~head~0.offset) .cse2) (and (= dll_create_~head~0.base 0) (<= |dll_create_#in~len| dll_create_~len) .cse3 (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and .cse3 .cse0 (<= |dll_create_#in~len| (+ dll_create_~len 1)) .cse1 .cse2))) [2018-12-08 14:29:01,596 INFO L448 ceAbstractionStarter]: For program point L576-3(lines 576 589) no Hoare annotation was computed. [2018-12-08 14:29:01,596 INFO L448 ceAbstractionStarter]: For program point dll_createFINAL(lines 574 591) no Hoare annotation was computed. [2018-12-08 14:29:01,596 INFO L451 ceAbstractionStarter]: At program point L579(line 579) the Hoare annotation is: true [2018-12-08 14:29:01,596 INFO L448 ceAbstractionStarter]: For program point dll_createEXIT(lines 574 591) no Hoare annotation was computed. [2018-12-08 14:29:01,596 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2018-12-08 14:29:01,596 INFO L448 ceAbstractionStarter]: For program point L584-2(lines 584 586) no Hoare annotation was computed. [2018-12-08 14:29:01,596 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 580) no Hoare annotation was computed. [2018-12-08 14:29:01,596 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 14:29:01,596 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-08 14:29:01,597 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 14:29:01,597 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 14:29:01,597 INFO L444 ceAbstractionStarter]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse1 (<= (+ dll_get_data_at_~index 1) |dll_get_data_at_#in~index|))) (or (and (<= |dll_get_data_at_#in~index| dll_get_data_at_~index) (<= dll_get_data_at_~index |dll_get_data_at_#in~index|) (and (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= dll_get_data_at_~head.base |dll_get_data_at_#in~head.base|))) (and (and (or (not (= |dll_get_data_at_#in~head.offset| 0)) (let ((.cse0 (+ (- 0) 4))) (and (= dll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |dll_get_data_at_#in~head.base|) .cse0)) (= dll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |dll_get_data_at_#in~head.base|) .cse0))))) (<= 1 |dll_get_data_at_#in~index|)) .cse1) (and (<= 2 |dll_get_data_at_#in~index|) .cse1))) [2018-12-08 14:29:01,597 INFO L448 ceAbstractionStarter]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2018-12-08 14:29:01,597 INFO L448 ceAbstractionStarter]: For program point dll_get_data_atFINAL(lines 599 605) no Hoare annotation was computed. [2018-12-08 14:29:01,597 INFO L451 ceAbstractionStarter]: At program point dll_get_data_atENTRY(lines 599 605) the Hoare annotation is: true [2018-12-08 14:29:01,597 INFO L448 ceAbstractionStarter]: For program point dll_get_data_atEXIT(lines 599 605) no Hoare annotation was computed. [2018-12-08 14:29:01,597 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2018-12-08 14:29:01,597 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 613 632) no Hoare annotation was computed. [2018-12-08 14:29:01,597 INFO L448 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-12-08 14:29:01,597 INFO L444 ceAbstractionStarter]: At program point L624(line 624) the Hoare annotation is: (let ((.cse9 (+ 0 4))) (let ((.cse8 (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse9))) (let ((.cse1 (select (select |#memory_int| .cse8) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse9)))) (let ((.cse0 (= 0 main_~s~0.offset)) (.cse2 (<= .cse1 (+ main_~len~0 1))) (.cse3 (<= (* 2 main_~len~0) (+ .cse1 1))) (.cse4 (= main_~len~0 2)) (.cse5 (not (= .cse8 main_~s~0.base)))) (or (and .cse0 (<= 1 main_~i~0) (<= (+ main_~i~0 .cse1) (+ main_~expected~0 1)) .cse2 .cse3 .cse4 (<= main_~expected~0 .cse1) .cse5) (and .cse0 .cse2 (let ((.cse7 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (let ((.cse6 (+ main_~i~0 .cse7))) (and (<= main_~expected~0 .cse6) (<= .cse7 main_~len~0) (<= .cse6 main_~expected~0) (<= main_~len~0 .cse7) (= main_~i~0 0)))) .cse3 .cse4 .cse5)))))) [2018-12-08 14:29:01,597 INFO L448 ceAbstractionStarter]: For program point L624-1(line 624) no Hoare annotation was computed. [2018-12-08 14:29:01,597 INFO L448 ceAbstractionStarter]: For program point L624-2(lines 624 626) no Hoare annotation was computed. [2018-12-08 14:29:01,597 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 613 632) no Hoare annotation was computed. [2018-12-08 14:29:01,597 INFO L444 ceAbstractionStarter]: At program point L620(line 620) the Hoare annotation is: (let ((.cse5 (+ main_~i~0 2))) (let ((.cse1 (= 0 main_~s~0.offset)) (.cse2 (<= main_~new_data~0 .cse5)) (.cse3 (<= .cse5 main_~new_data~0)) (.cse4 (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) main_~s~0.base)))) (or (and (and (let ((.cse0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (and (<= (+ main_~i~0 1) .cse0) .cse1 (<= 1 main_~i~0) (<= .cse0 main_~len~0) .cse2 .cse3)) .cse4) (<= main_~len~0 2)) (and .cse1 (and .cse2 .cse3) (= main_~len~0 2) (= main_~i~0 0) .cse4)))) [2018-12-08 14:29:01,597 INFO L448 ceAbstractionStarter]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2018-12-08 14:29:01,597 INFO L448 ceAbstractionStarter]: For program point L620-1(lines 618 621) no Hoare annotation was computed. [2018-12-08 14:29:01,598 INFO L444 ceAbstractionStarter]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse7 (+ 0 4))) (let ((.cse5 (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse7))) (let ((.cse6 (select (select |#memory_int| .cse5) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse7)))) (let ((.cse0 (= 0 main_~s~0.offset)) (.cse1 (<= .cse6 (+ main_~len~0 1))) (.cse2 (<= (* 2 main_~len~0) (+ .cse6 1))) (.cse4 (<= 2 main_~len~0)) (.cse3 (not (= .cse5 main_~s~0.base)))) (or (and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) .cse0 .cse1 .cse2 (= main_~len~0 2) (= main_~i~0 0) .cse3) (and (<= 2 main_~i~0) (<= main_~len~0 2) .cse4) (and .cse0 (<= 1 main_~i~0) .cse1 .cse2 .cse4 .cse3)))))) [2018-12-08 14:29:01,598 INFO L444 ceAbstractionStarter]: At program point L622-4(lines 622 627) the Hoare annotation is: (<= 2 main_~len~0) [2018-12-08 14:29:01,598 INFO L444 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= main_~len~0 2) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-12-08 14:29:01,598 INFO L444 ceAbstractionStarter]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse7 (+ 0 4))) (let ((.cse6 (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse7))) (let ((.cse3 (= main_~len~0 2)) (.cse2 (= 0 main_~s~0.offset)) (.cse0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse4 (not (= .cse6 main_~s~0.base)))) (or (and (let ((.cse1 (+ main_~i~0 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) .cse2 (<= 1 main_~i~0) (<= main_~i~0 1))) .cse3 .cse4) (and .cse2 .cse3 (= main_~i~0 0) .cse4) (and (let ((.cse5 (select (select |#memory_int| .cse6) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse7)))) (and .cse2 (and (<= 2 main_~i~0) (<= .cse0 main_~len~0) (<= main_~i~0 .cse0)) (<= (+ main_~i~0 main_~len~0) (+ .cse5 1)) (<= .cse5 (+ main_~len~0 1)) .cse4)) (<= main_~len~0 2)))))) [2018-12-08 14:29:01,598 INFO L448 ceAbstractionStarter]: For program point L616-1(line 616) no Hoare annotation was computed. [2018-12-08 14:29:01,598 INFO L448 ceAbstractionStarter]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2018-12-08 14:29:01,598 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 613 632) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-12-08 14:29:01,598 INFO L444 ceAbstractionStarter]: At program point L625(lines 613 632) the Hoare annotation is: false [2018-12-08 14:29:01,598 INFO L448 ceAbstractionStarter]: For program point dll_destroyEXIT(lines 592 598) no Hoare annotation was computed. [2018-12-08 14:29:01,598 INFO L451 ceAbstractionStarter]: At program point dll_destroyENTRY(lines 592 598) the Hoare annotation is: true [2018-12-08 14:29:01,598 INFO L451 ceAbstractionStarter]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2018-12-08 14:29:01,598 INFO L448 ceAbstractionStarter]: For program point L593-3(lines 592 598) no Hoare annotation was computed. [2018-12-08 14:29:01,604 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,604 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,605 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,605 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,605 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,605 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,605 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,606 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,607 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,608 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,608 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,608 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,609 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,609 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,609 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,609 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,609 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,609 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,609 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,611 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,612 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,612 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,612 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,612 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,612 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,612 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,612 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,612 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,613 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,613 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,613 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,613 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,613 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,613 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,613 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,613 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,613 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,614 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,614 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,614 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,614 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,614 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,614 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,614 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,614 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,614 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,614 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,614 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,614 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,615 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,615 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,615 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,615 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,615 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,615 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,615 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,615 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,616 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,616 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,616 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,616 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,616 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,616 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,616 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,616 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,616 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,617 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,617 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,617 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,617 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,617 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,617 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,617 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,617 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,620 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,620 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,620 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,621 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,621 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,621 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,621 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,622 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,622 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,622 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,622 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,622 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,623 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,623 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,623 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,624 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,624 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,624 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,624 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,624 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,624 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,624 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,624 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,624 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,624 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,624 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,625 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,625 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,625 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,625 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,625 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,626 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,626 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,626 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,626 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,626 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,626 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,626 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,628 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,628 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,628 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,628 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,628 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,628 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,629 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,629 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,629 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,629 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,629 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,629 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,629 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,631 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,631 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,631 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,631 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 02:29:01 BoogieIcfgContainer [2018-12-08 14:29:01,632 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 14:29:01,632 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 14:29:01,632 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 14:29:01,632 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 14:29:01,633 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:28:36" (3/4) ... [2018-12-08 14:29:01,635 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 14:29:01,639 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_update_at [2018-12-08 14:29:01,639 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 14:29:01,639 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-08 14:29:01,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create [2018-12-08 14:29:01,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_get_data_at [2018-12-08 14:29:01,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 14:29:01,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_destroy [2018-12-08 14:29:01,642 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-08 14:29:01,643 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-08 14:29:01,643 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 14:29:01,660 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\valid[head] == 1 && !(#memory_$Pointer$[new_head][new_head + 4] == new_head)) && !(#memory_$Pointer$[head][0 + 4] == head)) && \valid[new_head] == 1) && 0 == head) && 0 == new_head) || (((((head == 0 && \old(len) <= len) && head == 0) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || ((((head == 0 && \valid[head] == 1) && \old(len) <= len + 1) && \valid[new_head] == 1) && 0 == new_head) [2018-12-08 14:29:01,660 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 <= \old(index)) || ((((1 <= \old(index) && head == \old(#memory_$Pointer$)[head][head + 4]) && index + 1 <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || (((((((head == head && index <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \old(index) <= index) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && data == \old(data)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && head == head)) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 <= \old(index)) || ((#memory_$Pointer$[head][head + 4] == head && data == \old(data)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || \old(index) <= index) [2018-12-08 14:29:01,660 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(index) <= index && index <= \old(index)) && head == head && head == head) || (((!(head == 0) || (head == #memory_$Pointer$[head][-0 + 4] && head == #memory_$Pointer$[head][-0 + 4])) && 1 <= \old(index)) && index + 1 <= \old(index))) || (2 <= \old(index) && index + 1 <= \old(index)) [2018-12-08 14:29:01,669 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_46cef819-9159-4e19-b9c3-c6bbeec2a5af/bin-2019/uautomizer/witness.graphml [2018-12-08 14:29:01,669 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 14:29:01,670 INFO L168 Benchmark]: Toolchain (without parser) took 25636.09 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 239.1 MB). Free memory was 951.7 MB in the beginning and 967.2 MB in the end (delta: -15.5 MB). Peak memory consumption was 223.6 MB. Max. memory is 11.5 GB. [2018-12-08 14:29:01,670 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:29:01,670 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -146.6 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-08 14:29:01,670 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.35 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. [2018-12-08 14:29:01,671 INFO L168 Benchmark]: Boogie Preprocessor took 19.42 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 14:29:01,671 INFO L168 Benchmark]: RCFGBuilder took 242.46 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-12-08 14:29:01,671 INFO L168 Benchmark]: TraceAbstraction took 25039.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 127.4 MB). Free memory was 1.1 GB in the beginning and 967.2 MB in the end (delta: 103.2 MB). Peak memory consumption was 230.6 MB. Max. memory is 11.5 GB. [2018-12-08 14:29:01,671 INFO L168 Benchmark]: Witness Printer took 37.16 ms. Allocated memory is still 1.3 GB. Free memory is still 967.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:29:01,672 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 273.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -146.6 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.35 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. * Boogie Preprocessor took 19.42 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 242.46 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25039.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 127.4 MB). Free memory was 1.1 GB in the beginning and 967.2 MB in the end (delta: 103.2 MB). Peak memory consumption was 230.6 MB. Max. memory is 11.5 GB. * Witness Printer took 37.16 ms. Allocated memory is still 1.3 GB. Free memory is still 967.2 MB. There was no memory consumed. 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$.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$.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$.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$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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$.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 630]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 618]: Loop Invariant [2018-12-08 14:29:01,675 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,675 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,675 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,675 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,675 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,676 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,676 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,677 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,677 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,677 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,677 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,677 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,678 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,678 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((unknown-#memory_int-unknown[s][s] <= i + 1 && i + 1 <= unknown-#memory_int-unknown[s][s]) && 0 == s) && 1 <= i) && i <= 1) && len == 2) && !(#memory_$Pointer$[s][0 + 4] == s)) || (((0 == s && len == 2) && i == 0) && !(#memory_$Pointer$[s][0 + 4] == s))) || (((((0 == s && (2 <= i && unknown-#memory_int-unknown[s][s] <= len) && i <= unknown-#memory_int-unknown[s][s]) && i + len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][0 + 4]][#memory_$Pointer$[s][0 + 4]] + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][0 + 4]][#memory_$Pointer$[s][0 + 4]] <= len + 1) && !(#memory_$Pointer$[s][0 + 4] == s)) && len <= 2) - InvariantResult [Line: 607]: Loop Invariant [2018-12-08 14:29:01,679 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,679 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,679 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,679 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,679 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,679 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,680 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,680 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,680 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,680 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,680 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,680 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,680 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,680 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,680 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,680 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,680 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,680 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,682 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,682 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,682 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,682 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,682 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,682 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,682 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,682 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,682 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,682 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,683 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,683 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,683 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,683 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,683 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,683 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,683 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,685 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,685 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 <= \old(index)) || ((((1 <= \old(index) && head == \old(#memory_$Pointer$)[head][head + 4]) && index + 1 <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || (((((((head == head && index <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \old(index) <= index) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && data == \old(data)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && head == head)) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 <= \old(index)) || ((#memory_$Pointer$[head][head + 4] == head && data == \old(data)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || \old(index) <= index) - InvariantResult [Line: 600]: Loop Invariant [2018-12-08 14:29:01,685 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,685 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,685 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,685 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,685 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,686 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,686 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,686 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((\old(index) <= index && index <= \old(index)) && head == head && head == head) || (((!(head == 0) || (head == #memory_$Pointer$[head][-0 + 4] && head == #memory_$Pointer$[head][-0 + 4])) && 1 <= \old(index)) && index + 1 <= \old(index))) || (2 <= \old(index) && index + 1 <= \old(index)) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 576]: Loop Invariant [2018-12-08 14:29:01,686 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,686 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,686 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,686 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,686 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,686 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,686 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,687 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,687 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,687 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,688 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,688 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,688 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,688 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,688 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,688 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,688 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,688 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,688 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,688 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,688 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((\valid[head] == 1 && !(#memory_$Pointer$[new_head][new_head + 4] == new_head)) && !(#memory_$Pointer$[head][0 + 4] == head)) && \valid[new_head] == 1) && 0 == head) && 0 == new_head) || (((((head == 0 && \old(len) <= len) && head == 0) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || ((((head == 0 && \valid[head] == 1) && \old(len) <= len + 1) && \valid[new_head] == 1) && 0 == new_head) - InvariantResult [Line: 622]: Loop Invariant [2018-12-08 14:29:01,688 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,689 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,689 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,689 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,689 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,689 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,689 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,689 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,689 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,689 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,689 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,690 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,690 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,690 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,690 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,690 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,690 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,690 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,690 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,690 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,690 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,690 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,690 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,690 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,691 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,691 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,691 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,691 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,691 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,691 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,691 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,691 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,691 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,691 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:29:01,691 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:29:01,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:29:01,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:29:01,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((len == unknown-#memory_int-unknown[s][s] && 0 == s) && unknown-#memory_int-unknown[#memory_$Pointer$[s][0 + 4]][#memory_$Pointer$[s][0 + 4]] <= len + 1) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][0 + 4]][#memory_$Pointer$[s][0 + 4]] + 1) && len == 2) && i == 0) && !(#memory_$Pointer$[s][0 + 4] == s)) || ((2 <= i && len <= 2) && 2 <= len)) || (((((0 == s && 1 <= i) && unknown-#memory_int-unknown[#memory_$Pointer$[s][0 + 4]][#memory_$Pointer$[s][0 + 4]] <= len + 1) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][0 + 4]][#memory_$Pointer$[s][0 + 4]] + 1) && 2 <= len) && !(#memory_$Pointer$[s][0 + 4] == s)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 53 locations, 1 error locations. SAFE Result, 24.9s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 16.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 561 SDtfs, 609 SDslu, 2831 SDs, 0 SdLazy, 5168 SolverSat, 354 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 819 GetRequests, 545 SyntacticMatches, 7 SemanticMatches, 267 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4444 ImplicationChecksByTransitivity, 17.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 173 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 72 PreInvPairs, 102 NumberOfFragments, 869 HoareAnnotationTreeSize, 72 FomulaSimplifications, 9466 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 3131 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1260 NumberOfCodeBlocks, 1257 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1235 ConstructedInterpolants, 42 QuantifiedInterpolants, 358867 SizeOfPredicates, 67 NumberOfNonLiveVariables, 2568 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 375/490 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...