./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/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 0f7cafa734d0f20d504408b2e981cc49af978383 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/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 0f7cafa734d0f20d504408b2e981cc49af978383 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 06:04:56,469 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:04:56,470 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:04:56,478 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:04:56,478 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:04:56,479 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:04:56,480 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:04:56,481 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:04:56,482 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:04:56,483 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:04:56,484 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:04:56,484 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:04:56,485 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:04:56,486 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:04:56,486 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:04:56,487 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:04:56,488 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:04:56,489 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:04:56,490 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:04:56,492 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:04:56,492 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:04:56,493 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:04:56,495 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:04:56,495 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:04:56,495 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:04:56,496 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:04:56,497 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:04:56,497 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:04:56,498 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:04:56,499 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:04:56,499 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:04:56,499 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:04:56,500 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:04:56,500 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:04:56,501 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:04:56,501 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:04:56,501 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 06:04:56,512 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:04:56,512 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:04:56,513 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 06:04:56,513 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 06:04:56,513 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:04:56,513 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:04:56,514 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 06:04:56,514 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:04:56,514 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 06:04:56,514 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:04:56,514 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 06:04:56,514 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:04:56,515 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 06:04:56,515 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 06:04:56,515 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 06:04:56,515 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 06:04:56,515 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:04:56,515 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 06:04:56,516 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:04:56,516 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:04:56,516 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 06:04:56,516 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 06:04:56,516 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 06:04:56,516 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:04:56,516 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 06:04:56,517 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 06:04:56,517 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 06:04:56,517 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 06:04:56,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 06:04:56,517 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_5f948d9b-469e-4dbe-9765-13a317cd966d/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 -> 0f7cafa734d0f20d504408b2e981cc49af978383 [2018-11-10 06:04:56,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:04:56,549 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:04:56,551 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:04:56,552 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:04:56,552 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:04:56,553 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-10 06:04:56,591 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/data/1e83774bb/293b2198050748c3a578e12bac39a839/FLAG66a225390 [2018-11-10 06:04:56,976 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:04:56,977 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-10 06:04:56,985 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/data/1e83774bb/293b2198050748c3a578e12bac39a839/FLAG66a225390 [2018-11-10 06:04:56,994 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/data/1e83774bb/293b2198050748c3a578e12bac39a839 [2018-11-10 06:04:56,996 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:04:56,997 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 06:04:56,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:04:56,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:04:57,001 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:04:57,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:04:56" (1/1) ... [2018-11-10 06:04:57,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d533dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:57, skipping insertion in model container [2018-11-10 06:04:57,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:04:56" (1/1) ... [2018-11-10 06:04:57,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:04:57,042 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:04:57,248 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:04:57,256 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:04:57,292 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:04:57,326 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:04:57,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:57 WrapperNode [2018-11-10 06:04:57,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:04:57,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:04:57,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:04:57,328 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:04:57,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:57" (1/1) ... [2018-11-10 06:04:57,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:57" (1/1) ... [2018-11-10 06:04:57,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:57" (1/1) ... [2018-11-10 06:04:57,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:57" (1/1) ... [2018-11-10 06:04:57,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:57" (1/1) ... [2018-11-10 06:04:57,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:57" (1/1) ... [2018-11-10 06:04:57,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:57" (1/1) ... [2018-11-10 06:04:57,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:04:57,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:04:57,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:04:57,429 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:04:57,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 06:04:57,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 06:04:57,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:04:57,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-10 06:04:57,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-10 06:04:57,484 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-10 06:04:57,484 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-10 06:04:57,484 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-10 06:04:57,484 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-10 06:04:57,484 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-11-10 06:04:57,484 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 06:04:57,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 06:04:57,485 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-10 06:04:57,485 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-10 06:04:57,485 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-10 06:04:57,485 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-10 06:04:57,485 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-10 06:04:57,485 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-10 06:04:57,486 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-10 06:04:57,486 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-10 06:04:57,486 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-10 06:04:57,486 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-10 06:04:57,486 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-10 06:04:57,486 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-10 06:04:57,486 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-10 06:04:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-10 06:04:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-10 06:04:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-10 06:04:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-10 06:04:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-10 06:04:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-10 06:04:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-10 06:04:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-10 06:04:57,488 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-10 06:04:57,488 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-10 06:04:57,488 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-10 06:04:57,488 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-10 06:04:57,488 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-10 06:04:57,488 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-10 06:04:57,488 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-10 06:04:57,488 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-10 06:04:57,489 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-10 06:04:57,489 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-10 06:04:57,489 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-10 06:04:57,489 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-10 06:04:57,489 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-10 06:04:57,489 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-10 06:04:57,489 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-10 06:04:57,489 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-10 06:04:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-10 06:04:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-10 06:04:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-10 06:04:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-10 06:04:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-10 06:04:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-10 06:04:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-10 06:04:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-10 06:04:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-10 06:04:57,491 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-10 06:04:57,491 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-10 06:04:57,491 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-10 06:04:57,491 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-10 06:04:57,491 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-10 06:04:57,491 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-10 06:04:57,491 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 06:04:57,491 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-10 06:04:57,491 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-10 06:04:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-10 06:04:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-10 06:04:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-10 06:04:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-10 06:04:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-10 06:04:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-10 06:04:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-10 06:04:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-10 06:04:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-10 06:04:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-10 06:04:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 06:04:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-10 06:04:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-10 06:04:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-10 06:04:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-10 06:04:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-10 06:04:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-10 06:04:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-10 06:04:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-10 06:04:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-10 06:04:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-10 06:04:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-10 06:04:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-10 06:04:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-10 06:04:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-10 06:04:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-10 06:04:57,495 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-10 06:04:57,495 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-10 06:04:57,495 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-10 06:04:57,495 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-10 06:04:57,495 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-10 06:04:57,495 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-10 06:04:57,495 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-10 06:04:57,495 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-10 06:04:57,495 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-10 06:04:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-10 06:04:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-10 06:04:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-10 06:04:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-10 06:04:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-10 06:04:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-10 06:04:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-10 06:04:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-10 06:04:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-10 06:04:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-10 06:04:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-10 06:04:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-10 06:04:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-10 06:04:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-10 06:04:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-10 06:04:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-10 06:04:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 06:04:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 06:04:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 06:04:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-10 06:04:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-10 06:04:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 06:04:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 06:04:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-11-10 06:04:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 06:04:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 06:04:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 06:04:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:04:57,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 06:04:57,930 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:04:57,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:04:57 BoogieIcfgContainer [2018-11-10 06:04:57,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:04:57,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 06:04:57,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 06:04:57,935 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 06:04:57,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:04:56" (1/3) ... [2018-11-10 06:04:57,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ea9281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:04:57, skipping insertion in model container [2018-11-10 06:04:57,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:04:57" (2/3) ... [2018-11-10 06:04:57,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ea9281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:04:57, skipping insertion in model container [2018-11-10 06:04:57,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:04:57" (3/3) ... [2018-11-10 06:04:57,938 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-10 06:04:57,945 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 06:04:57,951 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 06:04:57,962 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 06:04:57,984 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:04:57,984 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 06:04:57,984 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 06:04:57,984 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 06:04:57,985 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:04:57,985 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:04:57,985 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 06:04:57,985 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:04:57,985 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 06:04:58,002 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-11-10 06:04:58,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 06:04:58,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:04:58,009 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:04:58,011 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:04:58,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:04:58,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1638660761, now seen corresponding path program 1 times [2018-11-10 06:04:58,018 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:04:58,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:04:58,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:04:58,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:04:58,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:04:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:04:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:04:58,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:04:58,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:04:58,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 06:04:58,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 06:04:58,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 06:04:58,162 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2018-11-10 06:04:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:04:58,183 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2018-11-10 06:04:58,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 06:04:58,184 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 41 [2018-11-10 06:04:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:04:58,191 INFO L225 Difference]: With dead ends: 142 [2018-11-10 06:04:58,191 INFO L226 Difference]: Without dead ends: 57 [2018-11-10 06:04:58,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 06:04:58,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-10 06:04:58,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-10 06:04:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 06:04:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-11-10 06:04:58,225 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 41 [2018-11-10 06:04:58,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:04:58,225 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-11-10 06:04:58,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 06:04:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-11-10 06:04:58,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 06:04:58,227 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:04:58,227 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:04:58,227 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:04:58,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:04:58,228 INFO L82 PathProgramCache]: Analyzing trace with hash 227048233, now seen corresponding path program 1 times [2018-11-10 06:04:58,228 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:04:58,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:04:58,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:04:58,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:04:58,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:04:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:04:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:04:58,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:04:58,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:04:58,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:04:58,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:04:58,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:04:58,323 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 3 states. [2018-11-10 06:04:58,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:04:58,350 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-10 06:04:58,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:04:58,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-11-10 06:04:58,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:04:58,353 INFO L225 Difference]: With dead ends: 78 [2018-11-10 06:04:58,353 INFO L226 Difference]: Without dead ends: 63 [2018-11-10 06:04:58,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:04:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-10 06:04:58,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2018-11-10 06:04:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 06:04:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-11-10 06:04:58,362 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 44 [2018-11-10 06:04:58,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:04:58,364 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-11-10 06:04:58,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:04:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-11-10 06:04:58,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 06:04:58,365 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:04:58,365 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:04:58,365 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:04:58,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:04:58,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1458379063, now seen corresponding path program 1 times [2018-11-10 06:04:58,366 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:04:58,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:04:58,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:04:58,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:04:58,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:04:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:04:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:04:58,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:04:58,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 06:04:58,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:04:58,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:04:58,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:04:58,435 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 5 states. [2018-11-10 06:04:58,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:04:58,477 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-11-10 06:04:58,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:04:58,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-10 06:04:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:04:58,478 INFO L225 Difference]: With dead ends: 111 [2018-11-10 06:04:58,478 INFO L226 Difference]: Without dead ends: 67 [2018-11-10 06:04:58,479 INFO L605 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-11-10 06:04:58,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-10 06:04:58,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-11-10 06:04:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-10 06:04:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-11-10 06:04:58,486 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 44 [2018-11-10 06:04:58,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:04:58,486 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-11-10 06:04:58,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:04:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-11-10 06:04:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 06:04:58,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:04:58,487 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:04:58,488 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:04:58,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:04:58,488 INFO L82 PathProgramCache]: Analyzing trace with hash 60923689, now seen corresponding path program 1 times [2018-11-10 06:04:58,488 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:04:58,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:04:58,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:04:58,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:04:58,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:04:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:04:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 06:04:58,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:04:58,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 06:04:58,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:04:58,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:04:58,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:04:58,554 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 5 states. [2018-11-10 06:04:58,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:04:58,599 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-11-10 06:04:58,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:04:58,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-11-10 06:04:58,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:04:58,600 INFO L225 Difference]: With dead ends: 79 [2018-11-10 06:04:58,600 INFO L226 Difference]: Without dead ends: 63 [2018-11-10 06:04:58,601 INFO L605 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-11-10 06:04:58,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-10 06:04:58,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-11-10 06:04:58,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 06:04:58,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-11-10 06:04:58,606 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 60 [2018-11-10 06:04:58,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:04:58,606 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-11-10 06:04:58,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:04:58,606 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-10 06:04:58,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 06:04:58,607 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:04:58,607 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:04:58,608 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:04:58,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:04:58,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1117673346, now seen corresponding path program 1 times [2018-11-10 06:04:58,608 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:04:58,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:04:58,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:04:58,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:04:58,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:04:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:04:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 06:04:58,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:04:58,692 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:04:58,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:04:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:04:58,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:04:58,800 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 06:04:58,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:04:58,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 06:04:58,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 06:04:58,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 06:04:58,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 06:04:58,831 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 6 states. [2018-11-10 06:04:58,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:04:58,931 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2018-11-10 06:04:58,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 06:04:58,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-10 06:04:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:04:58,932 INFO L225 Difference]: With dead ends: 116 [2018-11-10 06:04:58,932 INFO L226 Difference]: Without dead ends: 73 [2018-11-10 06:04:58,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 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-11-10 06:04:58,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-10 06:04:58,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-11-10 06:04:58,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 06:04:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-11-10 06:04:58,940 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 64 [2018-11-10 06:04:58,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:04:58,941 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-11-10 06:04:58,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 06:04:58,941 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-11-10 06:04:58,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 06:04:58,942 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:04:58,943 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:04:58,943 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:04:58,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:04:58,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1945968610, now seen corresponding path program 2 times [2018-11-10 06:04:58,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:04:58,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:04:58,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:04:58,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:04:58,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:04:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:00,407 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 06:05:00,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:05:00,407 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:05:00,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 06:05:00,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 06:05:00,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:05:00,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:05:00,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 06:05:00,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:00,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:00,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 06:05:00,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:05:00,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:05:00,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:00,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:00,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:00,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-11-10 06:05:01,627 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:01,628 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:01,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 treesize of output 8 [2018-11-10 06:05:01,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:01,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 79 [2018-11-10 06:05:01,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2018-11-10 06:05:01,667 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:01,738 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:01,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 80 [2018-11-10 06:05:01,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:01,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 66 [2018-11-10 06:05:01,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-11-10 06:05:01,843 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:01,894 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:01,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 74 [2018-11-10 06:05:01,903 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:01,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 66 [2018-11-10 06:05:01,995 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-11-10 06:05:01,999 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:02,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 73 [2018-11-10 06:05:02,011 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:02,048 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:02,079 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:02,165 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:02,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 55 [2018-11-10 06:05:02,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:02,180 INFO L477 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 2 case distinctions, treesize of input 42 treesize of output 70 [2018-11-10 06:05:02,181 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:02,213 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:02,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:02,218 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:02,220 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:02,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 68 [2018-11-10 06:05:02,226 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:02,249 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 96 [2018-11-10 06:05:02,254 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-11-10 06:05:02,343 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-11-10 06:05:02,548 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 9 xjuncts. [2018-11-10 06:05:02,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 65 [2018-11-10 06:05:02,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 51 [2018-11-10 06:05:02,876 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:02,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-11-10 06:05:02,931 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:02,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2018-11-10 06:05:02,994 INFO L477 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 16 treesize of output 23 [2018-11-10 06:05:02,994 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:03,007 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:03,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2018-11-10 06:05:03,019 INFO L477 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 16 treesize of output 23 [2018-11-10 06:05:03,019 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:03,031 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:03,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 59 [2018-11-10 06:05:03,122 INFO L477 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 49 treesize of output 56 [2018-11-10 06:05:03,123 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:03,159 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:03,166 INFO L477 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 2 case distinctions, treesize of input 42 treesize of output 68 [2018-11-10 06:05:03,167 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:03,203 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:05:03,283 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:05:03,342 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:05:03,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-10 06:05:03,387 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 6 variables, input treesize:146, output treesize:165 [2018-11-10 06:05:03,530 INFO L477 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 48 treesize of output 38 [2018-11-10 06:05:03,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 26 [2018-11-10 06:05:03,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:03,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-10 06:05:03,543 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:03,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-11-10 06:05:03,552 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:03,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:03,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-10 06:05:03,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-10 06:05:03,569 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:03,572 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:03,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:03,580 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:77, output treesize:4 [2018-11-10 06:05:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 06:05:03,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:05:03,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 55 [2018-11-10 06:05:03,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-10 06:05:03,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-10 06:05:03,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2790, Unknown=23, NotChecked=0, Total=2970 [2018-11-10 06:05:03,613 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 55 states. [2018-11-10 06:05:07,458 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2018-11-10 06:05:07,715 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 70 [2018-11-10 06:05:08,169 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2018-11-10 06:05:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:05:09,009 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-10 06:05:09,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-10 06:05:09,009 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 80 [2018-11-10 06:05:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:05:09,011 INFO L225 Difference]: With dead ends: 101 [2018-11-10 06:05:09,011 INFO L226 Difference]: Without dead ends: 98 [2018-11-10 06:05:09,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=321, Invalid=5335, Unknown=44, NotChecked=0, Total=5700 [2018-11-10 06:05:09,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-10 06:05:09,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2018-11-10 06:05:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-10 06:05:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-11-10 06:05:09,023 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 80 [2018-11-10 06:05:09,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:05:09,024 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-11-10 06:05:09,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-10 06:05:09,024 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-11-10 06:05:09,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 06:05:09,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:05:09,025 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:09,026 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:05:09,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:09,026 INFO L82 PathProgramCache]: Analyzing trace with hash 260541314, now seen corresponding path program 1 times [2018-11-10 06:05:09,026 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:05:09,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:05:09,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:09,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:05:09,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:09,617 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 06:05:09,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:05:09,617 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:05:09,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:09,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:05:09,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:05:09,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:05:09,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:09,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:09,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:09,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-10 06:05:10,272 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:10,273 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 4 variables, input treesize:92, output treesize:1 [2018-11-10 06:05:10,293 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 06:05:10,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:05:10,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 38 [2018-11-10 06:05:10,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-10 06:05:10,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-10 06:05:10,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1275, Unknown=5, NotChecked=0, Total=1406 [2018-11-10 06:05:10,325 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 38 states. [2018-11-10 06:05:11,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:05:11,019 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-11-10 06:05:11,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 06:05:11,019 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2018-11-10 06:05:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:05:11,020 INFO L225 Difference]: With dead ends: 96 [2018-11-10 06:05:11,020 INFO L226 Difference]: Without dead ends: 81 [2018-11-10 06:05:11,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=221, Invalid=2323, Unknown=6, NotChecked=0, Total=2550 [2018-11-10 06:05:11,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-10 06:05:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-10 06:05:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-10 06:05:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-11-10 06:05:11,027 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 80 [2018-11-10 06:05:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:05:11,028 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-11-10 06:05:11,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-10 06:05:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-11-10 06:05:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 06:05:11,029 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:05:11,029 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:11,029 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:05:11,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:11,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1072962651, now seen corresponding path program 1 times [2018-11-10 06:05:11,030 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:05:11,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:05:11,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:11,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:11,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:05:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:12,612 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2018-11-10 06:05:12,988 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2018-11-10 06:05:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 06:05:13,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:05:13,516 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:05:13,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:13,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:05:13,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 06:05:13,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:13,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:13,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-10 06:05:13,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:05:13,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:05:13,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:13,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:13,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:13,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-10 06:05:14,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:05:14,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:05:14,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:14,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:14,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:05:14,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:05:14,211 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:14,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:14,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:14,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2018-11-10 06:05:16,240 WARN L179 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 61 [2018-11-10 06:05:16,246 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:16,250 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:16,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-10 06:05:16,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:16,389 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 198 treesize of output 171 [2018-11-10 06:05:16,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 177 [2018-11-10 06:05:16,397 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:16,832 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:16,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 180 [2018-11-10 06:05:16,837 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:17,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 176 treesize of output 154 [2018-11-10 06:05:17,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 157 [2018-11-10 06:05:17,375 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:17,599 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:17,601 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:17,601 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:17,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 178 [2018-11-10 06:05:17,608 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:17,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 154 [2018-11-10 06:05:17,880 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:17,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 143 [2018-11-10 06:05:17,889 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:17,905 INFO L477 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 2 case distinctions, treesize of input 133 treesize of output 169 [2018-11-10 06:05:17,906 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:17,973 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:18,023 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:18,165 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:18,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 154 [2018-11-10 06:05:18,186 INFO L477 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 22 treesize of output 35 [2018-11-10 06:05:18,186 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:18,215 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:18,354 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:05:18,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 173 treesize of output 153 [2018-11-10 06:05:18,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 154 [2018-11-10 06:05:18,837 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:19,138 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:19,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 150 [2018-11-10 06:05:19,141 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:05:19,180 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:05:19,509 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:19,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 155 [2018-11-10 06:05:19,528 INFO L477 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 16 treesize of output 23 [2018-11-10 06:05:19,529 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:19,560 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:19,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 153 [2018-11-10 06:05:19,943 INFO L477 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 153 treesize of output 160 [2018-11-10 06:05:19,944 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:20,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:20,057 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:20,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 164 [2018-11-10 06:05:20,084 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:20,183 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:20,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 149 treesize of output 148 [2018-11-10 06:05:20,531 INFO L477 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 148 treesize of output 155 [2018-11-10 06:05:20,531 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:20,647 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:20,649 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:20,650 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:20,650 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:20,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 198 [2018-11-10 06:05:20,682 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:20,819 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:05:20,992 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:21,097 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:21,179 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 134 [2018-11-10 06:05:21,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 128 [2018-11-10 06:05:21,185 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:21,416 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:21,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 131 [2018-11-10 06:05:21,417 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:21,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 121 [2018-11-10 06:05:21,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 109 [2018-11-10 06:05:21,680 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:21,788 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:21,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 129 [2018-11-10 06:05:21,790 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:21,888 INFO L477 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 115 [2018-11-10 06:05:21,897 INFO L477 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 16 treesize of output 23 [2018-11-10 06:05:21,897 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:21,923 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:22,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 96 [2018-11-10 06:05:22,043 INFO L477 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 16 treesize of output 23 [2018-11-10 06:05:22,043 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:22,063 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:22,156 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:22,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 118 [2018-11-10 06:05:22,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 108 [2018-11-10 06:05:22,352 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:22,456 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:22,457 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:22,457 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:22,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 100 treesize of output 121 [2018-11-10 06:05:22,461 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:22,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 112 [2018-11-10 06:05:22,587 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:22,588 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:22,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 123 [2018-11-10 06:05:22,598 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:22,668 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:05:22,758 INFO L477 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 100 treesize of output 91 [2018-11-10 06:05:22,763 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:22,765 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:22,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 62 [2018-11-10 06:05:22,774 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:22,803 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:22,922 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:05:23,123 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 06:05:23,142 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 132 [2018-11-10 06:05:23,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 126 [2018-11-10 06:05:23,146 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:23,431 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:23,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 129 [2018-11-10 06:05:23,432 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:23,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 116 [2018-11-10 06:05:23,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 106 [2018-11-10 06:05:23,691 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:23,794 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:23,795 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:23,795 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:23,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 98 treesize of output 119 [2018-11-10 06:05:23,796 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:23,895 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:23,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 112 [2018-11-10 06:05:23,912 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 3 xjuncts. [2018-11-10 06:05:24,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 102 [2018-11-10 06:05:24,050 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:24,050 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:24,051 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:24,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 100 [2018-11-10 06:05:24,053 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:24,080 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:24,130 INFO L477 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 96 treesize of output 87 [2018-11-10 06:05:24,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:24,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:24,134 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:24,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 76 [2018-11-10 06:05:24,137 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:24,152 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:24,181 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:24,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 122 treesize of output 115 [2018-11-10 06:05:24,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 103 [2018-11-10 06:05:24,404 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:24,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:24,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 131 [2018-11-10 06:05:24,494 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:24,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 109 [2018-11-10 06:05:24,598 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:24,599 INFO L477 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 0 case distinctions, treesize of input 102 treesize of output 96 [2018-11-10 06:05:24,600 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:24,655 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:24,656 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:24,656 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:24,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 100 [2018-11-10 06:05:24,659 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:24,694 INFO L267 ElimStorePlain]: Start of recursive call 57: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:24,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 102 [2018-11-10 06:05:24,784 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:24,785 INFO L477 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 0 case distinctions, treesize of input 97 treesize of output 91 [2018-11-10 06:05:24,786 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:24,843 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:24,844 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:24,845 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:24,845 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:24,845 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:24,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 126 [2018-11-10 06:05:24,849 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:24,894 INFO L267 ElimStorePlain]: Start of recursive call 60: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:24,931 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:24,965 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:25,049 INFO L477 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 95 treesize of output 106 [2018-11-10 06:05:25,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-10 06:05:25,052 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:25,064 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:25,070 INFO L477 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 109 [2018-11-10 06:05:25,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:05:25,073 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:25,090 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:25,095 INFO L477 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 104 treesize of output 115 [2018-11-10 06:05:25,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-10 06:05:25,098 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:25,111 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:25,117 INFO L477 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 107 treesize of output 104 [2018-11-10 06:05:25,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:05:25,120 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:25,134 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:25,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-10 06:05:25,256 INFO L202 ElimStorePlain]: Needed 70 recursive calls to eliminate 9 variables, input treesize:330, output treesize:368 [2018-11-10 06:05:25,529 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2018-11-10 06:05:25,538 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 78 [2018-11-10 06:05:25,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 60 [2018-11-10 06:05:25,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:25,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:25,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 82 [2018-11-10 06:05:25,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-11-10 06:05:25,614 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:25,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:25,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 123 [2018-11-10 06:05:25,688 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:25,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 91 [2018-11-10 06:05:25,690 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:25,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2018-11-10 06:05:25,744 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:25,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2018-11-10 06:05:25,852 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:25,876 INFO L267 ElimStorePlain]: Start of recursive call 6: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:25,920 INFO L477 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 0 case distinctions, treesize of input 46 treesize of output 38 [2018-11-10 06:05:25,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-10 06:05:25,922 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:25,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-10 06:05:25,930 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:25,935 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:25,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 62 [2018-11-10 06:05:25,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 46 treesize of output 38 [2018-11-10 06:05:25,987 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:26,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-11-10 06:05:26,022 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:26,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-10 06:05:26,068 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:26,086 INFO L267 ElimStorePlain]: Start of recursive call 13: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:26,113 INFO L477 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 45 treesize of output 45 [2018-11-10 06:05:26,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 06:05:26,117 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:26,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2018-11-10 06:05:26,137 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:26,151 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:26,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 8 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:26,215 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 14 variables, input treesize:393, output treesize:32 [2018-11-10 06:05:26,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 06:05:26,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:05:26,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:26,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:26,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:26,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2018-11-10 06:05:26,389 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 06:05:26,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:05:26,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 32] total 68 [2018-11-10 06:05:26,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-11-10 06:05:26,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-11-10 06:05:26,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=4289, Unknown=30, NotChecked=0, Total=4556 [2018-11-10 06:05:26,410 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 68 states. [2018-11-10 06:05:27,919 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2018-11-10 06:05:28,230 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2018-11-10 06:05:28,696 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 75 [2018-11-10 06:05:31,864 WARN L179 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2018-11-10 06:05:32,742 WARN L179 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-11-10 06:05:34,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:05:34,949 INFO L93 Difference]: Finished difference Result 134 states and 154 transitions. [2018-11-10 06:05:34,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-10 06:05:34,950 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 83 [2018-11-10 06:05:34,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:05:34,950 INFO L225 Difference]: With dead ends: 134 [2018-11-10 06:05:34,951 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 06:05:34,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3057 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=605, Invalid=10057, Unknown=50, NotChecked=0, Total=10712 [2018-11-10 06:05:34,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 06:05:34,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 06:05:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 06:05:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 06:05:34,953 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2018-11-10 06:05:34,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:05:34,954 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:05:34,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-11-10 06:05:34,954 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 06:05:34,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 06:05:34,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 06:05:35,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:05:35,323 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2018-11-10 06:05:35,723 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 47 [2018-11-10 06:05:35,742 INFO L425 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-11-10 06:05:35,742 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 560 562) no Hoare annotation was computed. [2018-11-10 06:05:35,742 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 560 562) the Hoare annotation is: true [2018-11-10 06:05:35,742 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 560 562) no Hoare annotation was computed. [2018-11-10 06:05:35,742 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 06:05:35,743 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-11-10 06:05:35,743 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 06:05:35,743 INFO L425 ceAbstractionStarter]: For program point L584(line 584) no Hoare annotation was computed. [2018-11-10 06:05:35,743 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-10 06:05:35,743 INFO L425 ceAbstractionStarter]: For program point L584-1(line 584) no Hoare annotation was computed. [2018-11-10 06:05:35,743 INFO L425 ceAbstractionStarter]: For program point L583-1(line 583) no Hoare annotation was computed. [2018-11-10 06:05:35,743 INFO L425 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 581 587) no Hoare annotation was computed. [2018-11-10 06:05:35,743 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 586) no Hoare annotation was computed. [2018-11-10 06:05:35,743 INFO L428 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 581 587) the Hoare annotation is: true [2018-11-10 06:05:35,743 INFO L428 ceAbstractionStarter]: At program point L582-3(lines 582 586) the Hoare annotation is: true [2018-11-10 06:05:35,743 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 581 587) no Hoare annotation was computed. [2018-11-10 06:05:35,743 INFO L425 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 63 67) no Hoare annotation was computed. [2018-11-10 06:05:35,743 INFO L425 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 63 67) no Hoare annotation was computed. [2018-11-10 06:05:35,743 INFO L425 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 63 67) no Hoare annotation was computed. [2018-11-10 06:05:35,744 INFO L425 ceAbstractionStarter]: For program point L576(line 576) no Hoare annotation was computed. [2018-11-10 06:05:35,744 INFO L421 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (or (and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~len| sll_create_~len) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |sll_create_#in~data| sll_create_~data) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (select (select |#memory_int| sll_create_~new_head~0.base) 0) |sll_create_#in~data|) (= 1 (select |#valid| sll_create_~head~0.base)) (not (= 0 sll_create_~new_head~0.base)) (= |sll_create_#in~data| sll_create_~data) (= |sll_create_#in~data| (select (select |#memory_int| sll_create_~head~0.base) 0)) (= 0 sll_create_~head~0.offset) (= 1 (select |#valid| sll_create_~new_head~0.base)) (= 0 sll_create_~new_head~0.offset) (not (= 0 sll_create_~head~0.base)))) [2018-11-10 06:05:35,744 INFO L425 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-11-10 06:05:35,744 INFO L425 ceAbstractionStarter]: For program point sll_createEXIT(lines 572 580) no Hoare annotation was computed. [2018-11-10 06:05:35,744 INFO L425 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-11-10 06:05:35,744 INFO L425 ceAbstractionStarter]: For program point L574-1(lines 574 578) no Hoare annotation was computed. [2018-11-10 06:05:35,744 INFO L425 ceAbstractionStarter]: For program point L574-3(lines 574 578) no Hoare annotation was computed. [2018-11-10 06:05:35,744 INFO L421 ceAbstractionStarter]: At program point L574-4(lines 574 578) the Hoare annotation is: (or (and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~len| sll_create_~len) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |sll_create_#in~data| sll_create_~data) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (select (select |#memory_int| sll_create_~new_head~0.base) 0) |sll_create_#in~data|) (= 1 (select |#valid| sll_create_~head~0.base)) (not (= 0 sll_create_~new_head~0.base)) (= |sll_create_#in~data| sll_create_~data) (= |sll_create_#in~data| (select (select |#memory_int| sll_create_~head~0.base) 0)) (= 0 sll_create_~head~0.offset) (= 1 (select |#valid| sll_create_~new_head~0.base)) (= 0 sll_create_~new_head~0.offset) (not (= 0 sll_create_~head~0.base)))) [2018-11-10 06:05:35,744 INFO L425 ceAbstractionStarter]: For program point L574-5(lines 574 578) no Hoare annotation was computed. [2018-11-10 06:05:35,744 INFO L421 ceAbstractionStarter]: At program point sll_createENTRY(lines 572 580) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-10 06:05:35,744 INFO L425 ceAbstractionStarter]: For program point sll_createFINAL(lines 572 580) no Hoare annotation was computed. [2018-11-10 06:05:35,744 INFO L425 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 68 72) no Hoare annotation was computed. [2018-11-10 06:05:35,745 INFO L425 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 68 72) no Hoare annotation was computed. [2018-11-10 06:05:35,745 INFO L425 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 68 72) no Hoare annotation was computed. [2018-11-10 06:05:35,745 INFO L421 ceAbstractionStarter]: At program point sll_insertENTRY(lines 588 603) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-10 06:05:35,745 INFO L425 ceAbstractionStarter]: For program point L591(line 591) no Hoare annotation was computed. [2018-11-10 06:05:35,745 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-10 06:05:35,745 INFO L421 ceAbstractionStarter]: At program point L589(line 589) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |sll_insert_#in~head.offset| sll_insert_~head.offset) (= |#memory_int| |old(#memory_int)|) (= |sll_insert_#in~head.base| sll_insert_~head.base) (= sll_insert_~index |sll_insert_#in~index|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-10 06:05:35,746 INFO L425 ceAbstractionStarter]: For program point sll_insertEXIT(lines 588 603) no Hoare annotation was computed. [2018-11-10 06:05:35,746 INFO L425 ceAbstractionStarter]: For program point L589-1(line 589) no Hoare annotation was computed. [2018-11-10 06:05:35,746 INFO L425 ceAbstractionStarter]: For program point L600(line 600) no Hoare annotation was computed. [2018-11-10 06:05:35,747 INFO L425 ceAbstractionStarter]: For program point L600-1(lines 597 601) no Hoare annotation was computed. [2018-11-10 06:05:35,747 INFO L425 ceAbstractionStarter]: For program point L598(line 598) no Hoare annotation was computed. [2018-11-10 06:05:35,747 INFO L425 ceAbstractionStarter]: For program point L594(line 594) no Hoare annotation was computed. [2018-11-10 06:05:35,747 INFO L425 ceAbstractionStarter]: For program point L594-1(line 594) no Hoare annotation was computed. [2018-11-10 06:05:35,747 INFO L425 ceAbstractionStarter]: For program point L592-1(lines 592 596) no Hoare annotation was computed. [2018-11-10 06:05:35,747 INFO L421 ceAbstractionStarter]: At program point L592-3(lines 592 596) the Hoare annotation is: (let ((.cse0 (@diff |old(#valid)| |#valid|))) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) 4 0))) (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) 4 0))) (= (select |old(#valid)| sll_insert_~new_node~0.base) 0) (not (= 0 sll_insert_~new_node~0.base)) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| .cse0))) (= |sll_insert_#in~head.base| sll_insert_~head.base) (<= 0 sll_insert_~new_node~0.offset) (exists ((node_create_~data Int)) (= (store |old(#memory_int)| sll_insert_~new_node~0.base (store (select |old(#memory_int)| sll_insert_~new_node~0.base) 0 node_create_~data)) |#memory_int|)) (= |#valid| (store |old(#valid)| .cse0 (select |#valid| .cse0))))) [2018-11-10 06:05:35,747 INFO L425 ceAbstractionStarter]: For program point L592-4(lines 588 603) no Hoare annotation was computed. [2018-11-10 06:05:35,747 INFO L425 ceAbstractionStarter]: For program point sll_insertFINAL(lines 588 603) no Hoare annotation was computed. [2018-11-10 06:05:35,747 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 06:05:35,747 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 06:05:35,747 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 06:05:35,748 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 06:05:35,748 INFO L425 ceAbstractionStarter]: For program point L609(line 609) no Hoare annotation was computed. [2018-11-10 06:05:35,748 INFO L421 ceAbstractionStarter]: At program point L611-3(lines 611 618) the Hoare annotation is: (and (<= main_~data~0 1) (= 0 |main_~#s~0.offset|) (<= 2 main_~len~0) (<= 1 main_~data~0)) [2018-11-10 06:05:35,748 INFO L425 ceAbstractionStarter]: For program point L607(line 607) no Hoare annotation was computed. [2018-11-10 06:05:35,748 INFO L425 ceAbstractionStarter]: For program point L611-4(lines 604 626) no Hoare annotation was computed. [2018-11-10 06:05:35,748 INFO L421 ceAbstractionStarter]: At program point L607-1(line 607) the Hoare annotation is: (let ((.cse4 (@diff |old(#valid)| |#valid|))) (and (let ((.cse0 (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (or (= 0 (select |old(#valid)| .cse0)) (let ((.cse1 (= 0 (select |old(#valid)| |sll_insert_#in~head.base|))) (.cse2 (select |old(#memory_$Pointer$.offset)| |sll_insert_#in~head.base|))) (and (or .cse1 (= (select |#memory_$Pointer$.offset| |sll_insert_#in~head.base|) .cse2)) (or .cse1 (let ((.cse3 (@diff |old(#memory_int)| |#memory_int|))) (and (= (store |old(#memory_int)| .cse3 (select |#memory_int| .cse3)) |#memory_int|) (or (= |#memory_int| |old(#memory_int)|) (not (= .cse3 .cse0))))) (not (= (select .cse2 |sll_insert_#in~head.offset|) 0))))) (= .cse0 |sll_insert_#in~head.base|))) (<= main_~data~0 1) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| .cse4))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 |main_~#s~0.offset|) (<= 1 main_~data~0) (<= 2 main_~len~0) (= (select |#valid| |main_~#s~0.base|) 1) (= |#valid| (store |old(#valid)| .cse4 (select |#valid| .cse4))))) [2018-11-10 06:05:35,748 INFO L425 ceAbstractionStarter]: For program point L607-2(line 607) no Hoare annotation was computed. [2018-11-10 06:05:35,748 INFO L425 ceAbstractionStarter]: For program point L607-3(line 607) no Hoare annotation was computed. [2018-11-10 06:05:35,748 INFO L425 ceAbstractionStarter]: For program point L607-4(line 607) no Hoare annotation was computed. [2018-11-10 06:05:35,748 INFO L425 ceAbstractionStarter]: For program point L607-5(line 607) no Hoare annotation was computed. [2018-11-10 06:05:35,748 INFO L425 ceAbstractionStarter]: For program point L607-6(line 607) no Hoare annotation was computed. [2018-11-10 06:05:35,748 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 604 626) no Hoare annotation was computed. [2018-11-10 06:05:35,749 INFO L425 ceAbstractionStarter]: For program point L607-7(line 607) no Hoare annotation was computed. [2018-11-10 06:05:35,749 INFO L425 ceAbstractionStarter]: For program point L622(line 622) no Hoare annotation was computed. [2018-11-10 06:05:35,749 INFO L428 ceAbstractionStarter]: At program point L622-1(line 622) the Hoare annotation is: true [2018-11-10 06:05:35,749 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 604 626) no Hoare annotation was computed. [2018-11-10 06:05:35,749 INFO L421 ceAbstractionStarter]: At program point L620(lines 604 626) the Hoare annotation is: (and (<= main_~data~0 1) (= 0 |main_~#s~0.offset|) (<= 2 main_~len~0) (<= 1 main_~data~0)) [2018-11-10 06:05:35,749 INFO L425 ceAbstractionStarter]: For program point L622-2(line 622) no Hoare annotation was computed. [2018-11-10 06:05:35,749 INFO L425 ceAbstractionStarter]: For program point L612(line 612) no Hoare annotation was computed. [2018-11-10 06:05:35,749 INFO L425 ceAbstractionStarter]: For program point L612-1(line 612) no Hoare annotation was computed. [2018-11-10 06:05:35,749 INFO L421 ceAbstractionStarter]: At program point L608(line 608) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (<= main_~data~0 1) (not (= 0 .cse0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 |main_~#s~0.offset|) (= main_~data~0 (select (select |#memory_int| .cse0) 0)) (= (select |#valid| .cse0) 1) (<= 1 main_~data~0) (<= 2 main_~len~0))) [2018-11-10 06:05:35,749 INFO L425 ceAbstractionStarter]: For program point L608-1(line 608) no Hoare annotation was computed. [2018-11-10 06:05:35,749 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 604 626) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-10 06:05:35,750 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2018-11-10 06:05:35,750 INFO L425 ceAbstractionStarter]: For program point L613(line 613) no Hoare annotation was computed. [2018-11-10 06:05:35,750 INFO L425 ceAbstractionStarter]: For program point L613-1(lines 613 615) no Hoare annotation was computed. [2018-11-10 06:05:35,750 INFO L425 ceAbstractionStarter]: For program point L611-1(lines 611 618) no Hoare annotation was computed. [2018-11-10 06:05:35,750 INFO L421 ceAbstractionStarter]: At program point node_createENTRY(lines 563 571) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-10 06:05:35,750 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-10 06:05:35,750 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-10 06:05:35,750 INFO L428 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-11-10 06:05:35,750 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-11-10 06:05:35,750 INFO L425 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-11-10 06:05:35,750 INFO L425 ceAbstractionStarter]: For program point L564(line 564) no Hoare annotation was computed. [2018-11-10 06:05:35,750 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-11-10 06:05:35,750 INFO L425 ceAbstractionStarter]: For program point L564-1(line 564) no Hoare annotation was computed. [2018-11-10 06:05:35,750 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-11-10 06:05:35,768 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:05:35,769 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:05:35,770 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:05:35,770 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:05:35,770 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:05:35,771 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:05:35,771 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:05:35,771 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:05:35,771 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:05:35,771 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:05:35,771 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:05:35,771 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:05:35,772 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:05:35,773 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:05:35,773 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:05:35,773 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:05:35,775 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:05:35,775 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:05:35,776 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:05:35,776 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:05:35,776 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:05:35,776 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:05:35,776 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:05:35,776 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:05:35,778 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:551) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:246) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translateSelect(Term2Expression.java:326) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:373) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:108) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:92) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:537) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-10 06:05:35,783 INFO L168 Benchmark]: Toolchain (without parser) took 38786.55 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 489.7 MB). Free memory was 958.5 MB in the beginning and 1.4 GB in the end (delta: -419.0 MB). Peak memory consumption was 581.2 MB. Max. memory is 11.5 GB. [2018-11-10 06:05:35,784 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:05:35,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.41 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 928.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-10 06:05:35,784 INFO L168 Benchmark]: Boogie Preprocessor took 101.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 928.9 MB in the beginning and 1.2 GB in the end (delta: -252.7 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-11-10 06:05:35,785 INFO L168 Benchmark]: RCFGBuilder took 501.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 59.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. [2018-11-10 06:05:35,786 INFO L168 Benchmark]: TraceAbstraction took 37851.02 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 302.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -255.2 MB). Peak memory consumption was 557.9 MB. Max. memory is 11.5 GB. [2018-11-10 06:05:35,787 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.41 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 928.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 928.9 MB in the beginning and 1.2 GB in the end (delta: -252.7 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 501.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 59.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37851.02 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 302.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -255.2 MB). Peak memory consumption was 557.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 624]: 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: 611]: Loop Invariant Derived loop invariant: ((data <= 1 && 0 == s) && 2 <= len) && 1 <= data - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 574]: Loop Invariant [2018-11-10 06:05:35,794 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:05:35,795 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:05:35,795 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:05:35,795 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:05:35,795 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:05:35,795 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:05:35,795 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:05:35,795 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:05:35,796 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:05:35,796 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:05:35,796 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:05:35,796 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:05:35,796 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:05:35,797 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:05:35,797 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:05:35,797 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:05:35,799 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:05:35,799 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:05:35,799 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:05:35,799 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:05:35,799 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:05:35,799 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:05:35,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:05:35,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((data <= \old(data) && \valid == \old(\valid)) && \old(len) <= len) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(data) <= data) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || ((((((((unknown-#memory_int-unknown[new_head][0] == \old(data) && 1 == \valid[head]) && !(0 == new_head)) && \old(data) == data) && \old(data) == unknown-#memory_int-unknown[head][0]) && 0 == head) && 1 == \valid[new_head]) && 0 == new_head) && !(0 == head)) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:551) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 06:05:37,388 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:05:37,390 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:05:37,400 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:05:37,401 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:05:37,402 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:05:37,403 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:05:37,404 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:05:37,405 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:05:37,406 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:05:37,407 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:05:37,407 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:05:37,408 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:05:37,409 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:05:37,411 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:05:37,411 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:05:37,412 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:05:37,414 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:05:37,415 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:05:37,417 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:05:37,418 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:05:37,419 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:05:37,421 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:05:37,421 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:05:37,422 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:05:37,423 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:05:37,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:05:37,424 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:05:37,425 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:05:37,426 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:05:37,426 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:05:37,426 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:05:37,427 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:05:37,427 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:05:37,427 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:05:37,428 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:05:37,428 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-10 06:05:37,441 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:05:37,441 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:05:37,442 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 06:05:37,442 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 06:05:37,443 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:05:37,443 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:05:37,443 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 06:05:37,443 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:05:37,444 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 06:05:37,444 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 06:05:37,444 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:05:37,444 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 06:05:37,444 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 06:05:37,444 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 06:05:37,444 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 06:05:37,445 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 06:05:37,445 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 06:05:37,445 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:05:37,445 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 06:05:37,447 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:05:37,447 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:05:37,447 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 06:05:37,447 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 06:05:37,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 06:05:37,448 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:05:37,448 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 06:05:37,448 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 06:05:37,448 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-10 06:05:37,448 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 06:05:37,448 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 06:05:37,448 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 06:05:37,449 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_5f948d9b-469e-4dbe-9765-13a317cd966d/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 -> 0f7cafa734d0f20d504408b2e981cc49af978383 [2018-11-10 06:05:37,483 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:05:37,494 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:05:37,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:05:37,498 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:05:37,498 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:05:37,499 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-10 06:05:37,554 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/data/c92625f14/a2446c066dc9453ca13dc0ae28eac4d5/FLAG2eb34ed00 [2018-11-10 06:05:37,944 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:05:37,945 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-10 06:05:37,953 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/data/c92625f14/a2446c066dc9453ca13dc0ae28eac4d5/FLAG2eb34ed00 [2018-11-10 06:05:37,963 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/data/c92625f14/a2446c066dc9453ca13dc0ae28eac4d5 [2018-11-10 06:05:37,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:05:37,966 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 06:05:37,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:05:37,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:05:37,971 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:05:37,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:05:37" (1/1) ... [2018-11-10 06:05:37,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f0f242b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:37, skipping insertion in model container [2018-11-10 06:05:37,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:05:37" (1/1) ... [2018-11-10 06:05:37,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:05:38,016 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:05:38,254 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:05:38,266 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:05:38,309 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:05:38,349 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:05:38,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:38 WrapperNode [2018-11-10 06:05:38,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:05:38,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:05:38,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:05:38,350 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:05:38,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:38" (1/1) ... [2018-11-10 06:05:38,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:38" (1/1) ... [2018-11-10 06:05:38,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:38" (1/1) ... [2018-11-10 06:05:38,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:38" (1/1) ... [2018-11-10 06:05:38,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:38" (1/1) ... [2018-11-10 06:05:38,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:38" (1/1) ... [2018-11-10 06:05:38,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:38" (1/1) ... [2018-11-10 06:05:38,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:05:38,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:05:38,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:05:38,447 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:05:38,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 06:05:38,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 06:05:38,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:05:38,485 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-10 06:05:38,485 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-10 06:05:38,485 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-10 06:05:38,486 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-10 06:05:38,486 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-10 06:05:38,486 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-10 06:05:38,486 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-11-10 06:05:38,486 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 06:05:38,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 06:05:38,487 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-10 06:05:38,487 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-10 06:05:38,488 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-10 06:05:38,488 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-10 06:05:38,488 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-10 06:05:38,488 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-10 06:05:38,488 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-10 06:05:38,488 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-10 06:05:38,488 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-10 06:05:38,489 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-10 06:05:38,489 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-10 06:05:38,489 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-10 06:05:38,489 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-10 06:05:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-10 06:05:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-10 06:05:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-10 06:05:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-10 06:05:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-10 06:05:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-10 06:05:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-10 06:05:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-10 06:05:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-10 06:05:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-10 06:05:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-10 06:05:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-10 06:05:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-10 06:05:38,492 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-10 06:05:38,492 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-10 06:05:38,492 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-10 06:05:38,492 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-10 06:05:38,492 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-10 06:05:38,492 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-10 06:05:38,492 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-10 06:05:38,493 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-10 06:05:38,493 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-10 06:05:38,493 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-10 06:05:38,493 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-10 06:05:38,493 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-10 06:05:38,493 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-10 06:05:38,493 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-10 06:05:38,494 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-10 06:05:38,494 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-10 06:05:38,494 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-10 06:05:38,494 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-10 06:05:38,494 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-10 06:05:38,494 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-10 06:05:38,494 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-10 06:05:38,494 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-10 06:05:38,495 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-10 06:05:38,495 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-10 06:05:38,495 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-10 06:05:38,495 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-10 06:05:38,495 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 06:05:38,495 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-10 06:05:38,495 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-10 06:05:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-10 06:05:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-10 06:05:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-10 06:05:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-10 06:05:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-10 06:05:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-10 06:05:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-10 06:05:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-10 06:05:38,496 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-10 06:05:38,497 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-10 06:05:38,497 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 06:05:38,497 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-10 06:05:38,497 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-10 06:05:38,497 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-10 06:05:38,497 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-10 06:05:38,497 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-10 06:05:38,497 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-10 06:05:38,497 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-10 06:05:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-10 06:05:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-10 06:05:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-10 06:05:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-10 06:05:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-10 06:05:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-10 06:05:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-10 06:05:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-10 06:05:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-10 06:05:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-10 06:05:38,499 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-10 06:05:38,499 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-10 06:05:38,499 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-10 06:05:38,499 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-10 06:05:38,499 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-10 06:05:38,499 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-10 06:05:38,499 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-10 06:05:38,499 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-10 06:05:38,499 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-10 06:05:38,500 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-10 06:05:38,500 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-10 06:05:38,500 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-10 06:05:38,500 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-10 06:05:38,500 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-10 06:05:38,500 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-10 06:05:38,500 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-10 06:05:38,500 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-10 06:05:38,500 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-10 06:05:38,500 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-10 06:05:38,501 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-10 06:05:38,501 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-10 06:05:38,501 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-10 06:05:38,501 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-10 06:05:38,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 06:05:38,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 06:05:38,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-10 06:05:38,501 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-10 06:05:38,501 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-10 06:05:38,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 06:05:38,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 06:05:38,502 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-11-10 06:05:38,502 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 06:05:38,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-10 06:05:38,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 06:05:38,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:05:38,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-10 06:05:38,905 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:05:38,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:05:38 BoogieIcfgContainer [2018-11-10 06:05:38,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:05:38,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 06:05:38,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 06:05:38,908 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 06:05:38,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:05:37" (1/3) ... [2018-11-10 06:05:38,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51944c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:05:38, skipping insertion in model container [2018-11-10 06:05:38,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:38" (2/3) ... [2018-11-10 06:05:38,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51944c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:05:38, skipping insertion in model container [2018-11-10 06:05:38,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:05:38" (3/3) ... [2018-11-10 06:05:38,911 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-10 06:05:38,917 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 06:05:38,923 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 06:05:38,935 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 06:05:38,959 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:05:38,960 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 06:05:38,960 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 06:05:38,960 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 06:05:38,960 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:05:38,961 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:05:38,961 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 06:05:38,961 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:05:38,961 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 06:05:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-11-10 06:05:38,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 06:05:38,986 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:05:38,987 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:38,990 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:05:38,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:38,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1638660761, now seen corresponding path program 1 times [2018-11-10 06:05:39,001 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 06:05:39,002 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:05:39,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:39,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:05:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:05:39,132 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 06:05:39,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:05:39,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:05:39,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 06:05:39,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 06:05:39,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 06:05:39,155 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2018-11-10 06:05:39,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:05:39,178 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2018-11-10 06:05:39,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 06:05:39,179 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 41 [2018-11-10 06:05:39,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:05:39,189 INFO L225 Difference]: With dead ends: 142 [2018-11-10 06:05:39,189 INFO L226 Difference]: Without dead ends: 57 [2018-11-10 06:05:39,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 06:05:39,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-10 06:05:39,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-10 06:05:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 06:05:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-11-10 06:05:39,233 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 41 [2018-11-10 06:05:39,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:05:39,234 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-11-10 06:05:39,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 06:05:39,234 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-11-10 06:05:39,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 06:05:39,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:05:39,237 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:39,237 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:05:39,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:39,238 INFO L82 PathProgramCache]: Analyzing trace with hash 227048233, now seen corresponding path program 1 times [2018-11-10 06:05:39,238 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 06:05:39,238 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:05:39,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:39,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:05:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:05:39,342 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 06:05:39,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:05:39,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:05:39,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:05:39,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:05:39,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:05:39,346 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 3 states. [2018-11-10 06:05:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:05:39,367 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-10 06:05:39,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:05:39,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-11-10 06:05:39,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:05:39,371 INFO L225 Difference]: With dead ends: 78 [2018-11-10 06:05:39,371 INFO L226 Difference]: Without dead ends: 63 [2018-11-10 06:05:39,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:05:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-10 06:05:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2018-11-10 06:05:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 06:05:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-11-10 06:05:39,381 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 44 [2018-11-10 06:05:39,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:05:39,383 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-11-10 06:05:39,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:05:39,383 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-11-10 06:05:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 06:05:39,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:05:39,385 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:39,386 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:05:39,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:39,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1458379063, now seen corresponding path program 1 times [2018-11-10 06:05:39,386 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 06:05:39,387 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:05:39,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:39,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:05:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:05:39,505 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 06:05:39,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:05:39,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 06:05:39,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:05:39,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:05:39,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:05:39,509 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 5 states. [2018-11-10 06:05:39,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:05:39,556 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-11-10 06:05:39,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:05:39,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-10 06:05:39,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:05:39,559 INFO L225 Difference]: With dead ends: 111 [2018-11-10 06:05:39,559 INFO L226 Difference]: Without dead ends: 67 [2018-11-10 06:05:39,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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-11-10 06:05:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-10 06:05:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-11-10 06:05:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-10 06:05:39,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-11-10 06:05:39,569 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 44 [2018-11-10 06:05:39,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:05:39,569 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-11-10 06:05:39,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:05:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-11-10 06:05:39,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 06:05:39,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:05:39,571 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:39,571 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:05:39,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:39,571 INFO L82 PathProgramCache]: Analyzing trace with hash 60923689, now seen corresponding path program 1 times [2018-11-10 06:05:39,572 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 06:05:39,572 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:05:39,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:39,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:05:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:05:39,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:05:39,937 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 06:05:39,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:05:39,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-10 06:05:39,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 06:05:39,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 06:05:39,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-10 06:05:39,941 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 9 states. [2018-11-10 06:05:40,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:05:40,103 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2018-11-10 06:05:40,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 06:05:40,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-10 06:05:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:05:40,106 INFO L225 Difference]: With dead ends: 118 [2018-11-10 06:05:40,107 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 06:05:40,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-10 06:05:40,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 06:05:40,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2018-11-10 06:05:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-10 06:05:40,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2018-11-10 06:05:40,115 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 60 [2018-11-10 06:05:40,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:05:40,115 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2018-11-10 06:05:40,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 06:05:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2018-11-10 06:05:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 06:05:40,117 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:05:40,117 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:40,117 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:05:40,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:40,118 INFO L82 PathProgramCache]: Analyzing trace with hash -646735991, now seen corresponding path program 2 times [2018-11-10 06:05:40,118 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 06:05:40,118 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:05:40,140 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 06:05:40,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 06:05:40,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:05:40,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:05:40,256 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 06:05:40,256 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 06:05:40,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:05:40,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 06:05:40,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:05:40,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:05:40,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:05:40,259 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 5 states. [2018-11-10 06:05:40,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:05:40,315 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-11-10 06:05:40,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:05:40,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-10 06:05:40,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:05:40,317 INFO L225 Difference]: With dead ends: 86 [2018-11-10 06:05:40,317 INFO L226 Difference]: Without dead ends: 70 [2018-11-10 06:05:40,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 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-11-10 06:05:40,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-10 06:05:40,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-10 06:05:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 06:05:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-11-10 06:05:40,325 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 76 [2018-11-10 06:05:40,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:05:40,326 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-11-10 06:05:40,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:05:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-11-10 06:05:40,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 06:05:40,327 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:05:40,328 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:05:40,328 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:05:40,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:05:40,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1945968610, now seen corresponding path program 1 times [2018-11-10 06:05:40,330 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 06:05:40,330 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:05:40,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:05:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:40,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:05:40,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 06:05:40,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:40,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:40,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 06:05:40,569 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-11-10 06:05:40,822 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:40,823 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:40,824 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:40,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-11-10 06:05:40,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2018-11-10 06:05:40,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:40,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:40,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:05:40,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-11-10 06:05:40,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:05:40,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:05:40,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:40,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:40,950 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-11-10 06:05:40,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:52 [2018-11-10 06:05:41,905 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_insert_~new_node~0.base (_ BitVec 32)) (sll_insert_~snd_to_last~0.offset (_ BitVec 32)) (sll_insert_~last~0.base (_ BitVec 32)) (sll_insert_~new_node~0.offset (_ BitVec 32))) (and (= (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))))) (let ((.cse2 (select (select .cse1 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd sll_insert_~snd_to_last~0.offset (_ bv4 32)) sll_insert_~new_node~0.base)))))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) (bvadd sll_insert_~new_node~0.offset (_ bv4 32)) sll_insert_~last~0.base))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base)))) is different from true [2018-11-10 06:05:42,395 WARN L179 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-11-10 06:05:42,430 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:42,442 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:42,454 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:42,455 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:42,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-10 06:05:42,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:42,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 96 [2018-11-10 06:05:42,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 06:05:42,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:42,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 76 [2018-11-10 06:05:42,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 06:05:42,819 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:42,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 70 [2018-11-10 06:05:42,969 INFO L477 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 18 treesize of output 27 [2018-11-10 06:05:42,970 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-10 06:05:43,043 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:43,134 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:43,208 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:43,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 06:05:43,327 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:186, output treesize:124 [2018-11-10 06:05:43,488 INFO L477 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 0 case distinctions, treesize of input 56 treesize of output 36 [2018-11-10 06:05:43,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-11-10 06:05:43,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:43,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 9 [2018-11-10 06:05:43,509 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:43,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:43,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:43,518 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:56, output treesize:4 [2018-11-10 06:05:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 23 not checked. [2018-11-10 06:05:43,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:05:44,009 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-10 06:05:44,309 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-10 06:05:44,461 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-10 06:05:46,470 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_node_create_~temp~0.offset_24 (_ BitVec 32)) (v_sll_insert_~snd_to_last~0.offset_12 (_ BitVec 32)) (v_sll_insert_~new_node~0.offset_10 (_ BitVec 32)) (v_sll_insert_~new_node~0.base_10 (_ BitVec 32)) (v_sll_insert_~last~0.base_12 (_ BitVec 32))) (or (not (= (select |c_#valid| v_sll_insert_~new_node~0.base_10) (_ bv0 1))) (not (= (_ bv0 32) (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| v_sll_insert_~new_node~0.base_10 (store (select |c_#memory_$Pointer$.base| v_sll_insert_~new_node~0.base_10) (bvadd v_node_create_~temp~0.offset_24 (_ bv4 32)) (_ bv0 32))))) (let ((.cse2 (select (select .cse1 |c_main_~#s~0.base|) |c_main_~#s~0.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd v_sll_insert_~snd_to_last~0.offset_12 (_ bv4 32)) v_sll_insert_~new_node~0.base_10)))))) (store .cse0 v_sll_insert_~new_node~0.base_10 (store (select .cse0 v_sll_insert_~new_node~0.base_10) (bvadd v_sll_insert_~new_node~0.offset_10 (_ bv4 32)) v_sll_insert_~last~0.base_12))) |c_main_~#s~0.base|) |c_main_~#s~0.offset|))))) is different from false [2018-11-10 06:05:46,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:05:46,481 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:05:46,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:05:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:05:46,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:05:46,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 06:05:46,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:46,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:46,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-11-10 06:05:47,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:05:47,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:05:47,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:47,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:47,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:05:47,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:05:47,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:47,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:47,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:47,309 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 [2018-11-10 06:05:50,434 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_insert_~new_node~0.base (_ BitVec 32)) (sll_insert_~last~0.base (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32))))) (let ((.cse2 (select (select .cse1 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32))) |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|) (_ bv4 32)) sll_insert_~new_node~0.base)))))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) (_ bv4 32) sll_insert_~last~0.base)))) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base)))) is different from true [2018-11-10 06:05:50,858 WARN L179 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2018-11-10 06:05:50,879 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:50,888 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:50,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 06:05:50,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:51,046 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 85 [2018-11-10 06:05:51,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2018-11-10 06:05:51,053 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:51,821 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:51,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 86 [2018-11-10 06:05:51,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:52,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 59 [2018-11-10 06:05:52,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-10 06:05:52,635 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:52,663 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:52,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 44 [2018-11-10 06:05:52,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2018-11-10 06:05:52,679 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:52,695 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:52,707 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:53,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 67 [2018-11-10 06:05:53,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-11-10 06:05:53,076 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:53,342 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:53,344 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:53,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 65 [2018-11-10 06:05:53,345 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:53,628 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:53,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 67 [2018-11-10 06:05:53,680 INFO L477 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 0 case distinctions, treesize of input 59 treesize of output 53 [2018-11-10 06:05:53,681 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:53,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 51 [2018-11-10 06:05:53,767 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:53,824 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:53,983 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:54,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 62 [2018-11-10 06:05:54,056 INFO L477 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 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-10 06:05:54,057 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:54,209 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:05:54,210 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:05:54,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 79 [2018-11-10 06:05:54,219 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:54,268 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:05:54,352 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:54,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:54,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-10 06:05:54,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-10 06:05:54,416 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:54,422 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:54,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:54,438 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 5 variables, input treesize:170, output treesize:30 [2018-11-10 06:05:54,632 INFO L477 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 32 treesize of output 28 [2018-11-10 06:05:54,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-10 06:05:54,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:54,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-10 06:05:54,655 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:54,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2018-11-10 06:05:54,673 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:05:54,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:54,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:05:54,678 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:4 [2018-11-10 06:05:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 06:05:54,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:05:55,463 WARN L179 SmtUtils]: Spent 565.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-11-10 06:05:55,635 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-10 06:05:55,991 WARN L179 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-10 06:05:56,130 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-10 06:05:58,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:05:58,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2018-11-10 06:05:58,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-10 06:05:58,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-10 06:05:58,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2628, Unknown=107, NotChecked=428, Total=3306 [2018-11-10 06:05:58,697 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 55 states. [2018-11-10 06:06:00,977 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 39 [2018-11-10 06:06:03,675 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2018-11-10 06:06:09,840 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-10 06:06:14,219 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-10 06:06:16,412 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((sll_insert_~new_node~0.base (_ BitVec 32)) (sll_insert_~last~0.base (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32))))) (let ((.cse2 (select (select .cse1 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32))) |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|) (_ bv4 32)) sll_insert_~new_node~0.base)))))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) (_ bv4 32) sll_insert_~last~0.base)))) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base)))) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_insert_~new_node~0.base (_ BitVec 32)) (sll_insert_~snd_to_last~0.offset (_ BitVec 32)) (sll_insert_~last~0.base (_ BitVec 32)) (sll_insert_~new_node~0.offset (_ BitVec 32))) (and (= (let ((.cse3 (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))))) (let ((.cse5 (select (select .cse4 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) (store .cse4 .cse5 (store (select .cse4 .cse5) (bvadd sll_insert_~snd_to_last~0.offset (_ bv4 32)) sll_insert_~new_node~0.base)))))) (store .cse3 sll_insert_~new_node~0.base (store (select .cse3 sll_insert_~new_node~0.base) (bvadd sll_insert_~new_node~0.offset (_ bv4 32)) sll_insert_~last~0.base))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base))))) is different from true [2018-11-10 06:06:18,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:06:18,553 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2018-11-10 06:06:18,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-10 06:06:18,559 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 80 [2018-11-10 06:06:18,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:06:18,560 INFO L225 Difference]: With dead ends: 133 [2018-11-10 06:06:18,560 INFO L226 Difference]: Without dead ends: 130 [2018-11-10 06:06:18,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=366, Invalid=6460, Unknown=166, NotChecked=840, Total=7832 [2018-11-10 06:06:18,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-10 06:06:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 81. [2018-11-10 06:06:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-10 06:06:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-11-10 06:06:18,576 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 80 [2018-11-10 06:06:18,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:06:18,577 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-11-10 06:06:18,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-10 06:06:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-11-10 06:06:18,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 06:06:18,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:06:18,579 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:06:18,579 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:06:18,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:06:18,580 INFO L82 PathProgramCache]: Analyzing trace with hash 260541314, now seen corresponding path program 1 times [2018-11-10 06:06:18,580 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 06:06:18,580 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:06:18,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:06:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:06:18,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:06:18,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 06:06:18,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:18,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:18,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 06:06:18,748 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-11-10 06:06:18,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:18,923 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:18,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-11-10 06:06:18,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-10 06:06:18,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:18,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:18,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:06:18,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2018-11-10 06:06:18,999 INFO L477 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 11 treesize of output 8 [2018-11-10 06:06:19,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:06:19,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:19,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:19,020 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-11-10 06:06:19,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:37 [2018-11-10 06:06:19,231 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)))) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)))) is different from true [2018-11-10 06:06:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 27 not checked. [2018-11-10 06:06:20,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:06:20,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:06:20,433 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:06:20,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:06:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:06:20,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:06:21,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:06:21,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:06:21,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:21,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:21,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:21,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-10 06:06:21,242 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 37 [2018-11-10 06:06:21,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-11-10 06:06:21,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:21,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 06:06:21,307 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 06:06:21,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:06:21,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:06:21,352 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2018-11-10 06:06:21,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-10 06:06:21,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-10 06:06:21,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:21,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:21,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:21,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-10 06:06:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 06:06:21,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:06:22,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-10 06:06:22,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:06:22,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:22,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-10 06:06:22,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:06:22,103 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:22,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:22,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:22,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:22,124 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:6 [2018-11-10 06:06:22,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-11-10 06:06:22,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 06:06:22,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:22,512 INFO L477 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 22 treesize of output 26 [2018-11-10 06:06:22,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-10 06:06:22,516 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:22,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 14 [2018-11-10 06:06:22,561 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-10 06:06:22,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2018-11-10 06:06:22,597 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:22,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:06:22,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-10 06:06:22,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 06:06:22,632 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:22,641 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:22,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-11-10 06:06:22,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-10 06:06:22,659 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:22,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2018-11-10 06:06:22,693 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-10 06:06:22,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-10 06:06:22,717 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:22,736 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:06:22,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-10 06:06:22,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-10 06:06:22,844 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:38, output treesize:83 [2018-11-10 06:06:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 06:06:23,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:06:23,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [24, 15] total 44 [2018-11-10 06:06:23,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-10 06:06:23,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-10 06:06:23,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1573, Unknown=117, NotChecked=166, Total=1980 [2018-11-10 06:06:23,649 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 44 states. [2018-11-10 06:06:25,089 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_sll_create_#t~ret4.base| (_ bv1 1))))) (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) (not (= (_ bv0 32) |c_sll_create_#t~ret4.base|))) is different from true [2018-11-10 06:06:29,755 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-10 06:06:31,494 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2018-11-10 06:06:33,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:06:33,540 INFO L93 Difference]: Finished difference Result 134 states and 153 transitions. [2018-11-10 06:06:33,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-10 06:06:33,545 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 80 [2018-11-10 06:06:33,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:06:33,547 INFO L225 Difference]: With dead ends: 134 [2018-11-10 06:06:33,547 INFO L226 Difference]: Without dead ends: 123 [2018-11-10 06:06:33,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=341, Invalid=4004, Unknown=223, NotChecked=402, Total=4970 [2018-11-10 06:06:33,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-10 06:06:33,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 98. [2018-11-10 06:06:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-10 06:06:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2018-11-10 06:06:33,566 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 80 [2018-11-10 06:06:33,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:06:33,566 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2018-11-10 06:06:33,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-10 06:06:33,567 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2018-11-10 06:06:33,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 06:06:33,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:06:33,568 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:06:33,569 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:06:33,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:06:33,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1072962651, now seen corresponding path program 1 times [2018-11-10 06:06:33,569 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 06:06:33,569 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 06:06:33,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:06:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:06:33,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:06:33,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 06:06:33,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:33,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:33,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-11-10 06:06:33,820 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-11-10 06:06:33,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:06:33,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:06:33,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:33,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:33,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:33,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 06:06:34,337 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:34,339 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:34,341 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:34,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-11-10 06:06:34,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2018-11-10 06:06:34,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:34,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:34,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:06:34,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:47 [2018-11-10 06:06:34,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:06:34,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:06:34,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:34,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:34,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:06:34,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:06:34,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:34,553 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:34,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:06:34,598 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:67 [2018-11-10 06:06:37,688 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_insert_~last~0.offset (_ BitVec 32)) (sll_insert_~new_node~0.base (_ BitVec 32)) (node_create_~data (_ BitVec 32)) (sll_insert_~snd_to_last~0.offset (_ BitVec 32)) (sll_insert_~last~0.base (_ BitVec 32)) (sll_insert_~new_node~0.offset (_ BitVec 32))) (let ((.cse5 (bvadd node_create_~temp~0.offset (_ bv4 32)))) (let ((.cse7 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) .cse5 (_ bv0 32))))) (let ((.cse1 (bvadd sll_insert_~new_node~0.offset (_ bv4 32))) (.cse3 (select (select .cse7 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)) (.cse4 (bvadd sll_insert_~snd_to_last~0.offset (_ bv4 32)))) (and (= (let ((.cse0 (let ((.cse2 (store |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) .cse5 (_ bv0 32))))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 sll_insert_~new_node~0.offset))))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) .cse1 sll_insert_~last~0.offset))) |c_#memory_$Pointer$.offset|) (= (let ((.cse6 (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 sll_insert_~new_node~0.base)))) (store .cse6 sll_insert_~new_node~0.base (store (select .cse6 sll_insert_~new_node~0.base) .cse1 sll_insert_~last~0.base))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base)) (= (store |c_old(#memory_int)| sll_insert_~new_node~0.base (store (select |c_old(#memory_int)| sll_insert_~new_node~0.base) node_create_~temp~0.offset node_create_~data)) |c_#memory_int|)))))) is different from true [2018-11-10 06:06:42,476 WARN L179 SmtUtils]: Spent 4.78 s on a formula simplification. DAG size of input: 103 DAG size of output: 79 [2018-11-10 06:06:42,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:42,619 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:42,664 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:06:42,665 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:42,666 INFO L303 Elim1Store]: Index analysis took 188 ms [2018-11-10 06:06:42,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37 [2018-11-10 06:06:42,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:44,152 INFO L303 Elim1Store]: Index analysis took 281 ms [2018-11-10 06:06:44,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 71 [2018-11-10 06:06:44,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 06:06:44,231 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:45,085 INFO L303 Elim1Store]: Index analysis took 525 ms [2018-11-10 06:06:45,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 64 [2018-11-10 06:06:45,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 06:06:45,127 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:45,727 INFO L303 Elim1Store]: Index analysis took 306 ms [2018-11-10 06:06:45,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 58 [2018-11-10 06:06:45,863 INFO L477 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 18 treesize of output 27 [2018-11-10 06:06:45,864 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-10 06:06:46,223 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:06:46,674 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:06:47,038 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:06:47,930 INFO L303 Elim1Store]: Index analysis took 113 ms [2018-11-10 06:06:47,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-11-10 06:06:47,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:06:47,946 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:48,015 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:48,689 INFO L303 Elim1Store]: Index analysis took 109 ms [2018-11-10 06:06:48,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 135 [2018-11-10 06:06:48,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 06:06:48,702 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:48,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 92 [2018-11-10 06:06:48,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 06:06:48,878 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:48,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 86 [2018-11-10 06:06:48,997 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:06:49,004 INFO L477 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 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-10 06:06:49,004 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:49,060 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:49,109 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:49,179 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:49,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 137 [2018-11-10 06:06:49,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 06:06:49,256 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:49,471 INFO L303 Elim1Store]: Index analysis took 105 ms [2018-11-10 06:06:49,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 92 [2018-11-10 06:06:49,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 06:06:49,485 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:49,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 86 [2018-11-10 06:06:49,662 INFO L477 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 18 treesize of output 27 [2018-11-10 06:06:49,663 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-11-10 06:06:49,750 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:06:49,875 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:06:50,046 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:06:50,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 06:06:50,405 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 12 variables, input treesize:341, output treesize:173 [2018-11-10 06:06:50,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 06:06:50,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 06:06:50,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:50,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:50,822 INFO L477 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 0 case distinctions, treesize of input 59 treesize of output 39 [2018-11-10 06:06:50,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-11-10 06:06:50,826 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:50,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-11-10 06:06:50,845 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:50,850 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:50,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:50,859 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:78, output treesize:16 [2018-11-10 06:06:51,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 06:06:51,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 06:06:51,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:51,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:51,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:51,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-10 06:06:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 14 not checked. [2018-11-10 06:06:51,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:06:52,167 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-10 06:06:52,291 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-10 06:06:53,327 WARN L179 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 85 [2018-11-10 06:06:53,952 WARN L179 SmtUtils]: Spent 624.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-10 06:06:55,340 WARN L179 SmtUtils]: Spent 1.39 s on a formula simplification that was a NOOP. DAG size: 77 [2018-11-10 06:06:56,749 WARN L179 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 69 [2018-11-10 06:06:58,762 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_sll_insert_~last~0.offset_30 (_ BitVec 32)) (v_node_create_~data_47 (_ BitVec 32)) (v_sll_insert_~new_node~0.offset_23 (_ BitVec 32)) (v_sll_insert_~new_node~0.base_23 (_ BitVec 32)) (v_node_create_~temp~0.offset_61 (_ BitVec 32)) (v_sll_insert_~snd_to_last~0.offset_30 (_ BitVec 32)) (v_sll_insert_~last~0.base_30 (_ BitVec 32))) (or (= (let ((.cse7 (bvadd v_node_create_~temp~0.offset_61 (_ bv4 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| v_sll_insert_~new_node~0.base_23 (store (select |c_#memory_$Pointer$.base| v_sll_insert_~new_node~0.base_23) .cse7 (_ bv0 32))))) (let ((.cse1 (bvadd v_sll_insert_~new_node~0.offset_23 (_ bv4 32))) (.cse3 (select (select .cse2 |c_main_~#s~0.base|) |c_main_~#s~0.offset|)) (.cse4 (bvadd v_sll_insert_~snd_to_last~0.offset_30 (_ bv4 32)))) (select (select (store |c_#memory_int| v_sll_insert_~new_node~0.base_23 (store (select |c_#memory_int| v_sll_insert_~new_node~0.base_23) v_node_create_~temp~0.offset_61 v_node_create_~data_47)) (select (select (let ((.cse0 (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_sll_insert_~new_node~0.base_23)))) (store .cse0 v_sll_insert_~new_node~0.base_23 (store (select .cse0 v_sll_insert_~new_node~0.base_23) .cse1 v_sll_insert_~last~0.base_30))) |c_main_~#s~0.base|) |c_main_~#s~0.offset|)) (select (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.offset| v_sll_insert_~new_node~0.base_23 (store (select |c_#memory_$Pointer$.offset| v_sll_insert_~new_node~0.base_23) .cse7 (_ bv0 32))))) (store .cse6 .cse3 (store (select .cse6 .cse3) .cse4 v_sll_insert_~new_node~0.offset_23))))) (store .cse5 v_sll_insert_~new_node~0.base_23 (store (select .cse5 v_sll_insert_~new_node~0.base_23) .cse1 v_sll_insert_~last~0.offset_30))) |c_main_~#s~0.base|) |c_main_~#s~0.offset|))))) c_main_~data~0) (not (= (select |c_#valid| v_sll_insert_~new_node~0.base_23) (_ bv0 1))))) is different from false [2018-11-10 06:06:58,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:06:58,775 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:06:58,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:06:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:06:58,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:06:59,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 06:06:59,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:59,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:59,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-10 06:06:59,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:06:59,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:06:59,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:06:59,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:59,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:06:59,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-10 06:07:00,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:07:00,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:07:00,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:00,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:00,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:07:00,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:07:00,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:00,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:00,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:00,754 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-10 06:07:08,951 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-10 06:07:09,006 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_insert_~last~0.offset (_ BitVec 32)) (sll_insert_~new_node~0.base (_ BitVec 32)) (node_create_~data (_ BitVec 32)) (sll_insert_~last~0.base (_ BitVec 32))) (let ((.cse1 (store |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)))) (.cse5 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32))))) (let ((.cse2 (select (select .cse5 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)) (.cse3 (bvadd (select (select .cse1 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|) (_ bv4 32)))) (and (= (store |c_old(#memory_int)| sll_insert_~new_node~0.base (store (select |c_old(#memory_int)| sll_insert_~new_node~0.base) (_ bv0 32) node_create_~data)) |c_#memory_int|) (= (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 (_ bv0 32))))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) (_ bv4 32) sll_insert_~last~0.offset))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse4 (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 sll_insert_~new_node~0.base)))) (store .cse4 sll_insert_~new_node~0.base (store (select .cse4 sll_insert_~new_node~0.base) (_ bv4 32) sll_insert_~last~0.base)))) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base)))))) is different from true [2018-11-10 06:07:11,706 WARN L179 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 120 DAG size of output: 58 [2018-11-10 06:07:11,800 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:11,834 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:11,835 INFO L303 Elim1Store]: Index analysis took 127 ms [2018-11-10 06:07:11,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-10 06:07:11,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:12,648 INFO L303 Elim1Store]: Index analysis took 417 ms [2018-11-10 06:07:12,821 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 194 treesize of output 167 [2018-11-10 06:07:12,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 173 [2018-11-10 06:07:12,857 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:31,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:31,202 INFO L303 Elim1Store]: Index analysis took 143 ms [2018-11-10 06:07:31,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 176 [2018-11-10 06:07:31,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:48,622 INFO L303 Elim1Store]: Index analysis took 530 ms [2018-11-10 06:07:48,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 172 treesize of output 150 [2018-11-10 06:07:48,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 153 [2018-11-10 06:07:48,866 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:55,045 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:55,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:55,057 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:07:55,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 135 treesize of output 165 [2018-11-10 06:07:55,114 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:07:55,485 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:08:01,406 INFO L303 Elim1Store]: Index analysis took 260 ms [2018-11-10 06:08:01,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 148 treesize of output 145 [2018-11-10 06:08:01,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:08:01,469 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:08:01,470 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:08:01,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 127 treesize of output 155 [2018-11-10 06:08:01,510 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:08:01,656 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:08:02,331 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-10 06:08:11,672 INFO L303 Elim1Store]: Index analysis took 182 ms [2018-11-10 06:08:11,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 145 treesize of output 144 [2018-11-10 06:08:11,726 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:08:11,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 141 [2018-11-10 06:08:11,748 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 06:08:12,164 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:08:14,576 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:08:14,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 157 [2018-11-10 06:08:14,623 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:08:14,633 INFO L477 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 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 06:08:14,634 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 06:08:14,731 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:08:15,687 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 06:08:22,196 INFO L303 Elim1Store]: Index analysis took 456 ms [2018-11-10 06:08:22,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 169 treesize of output 149 [2018-11-10 06:08:22,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 150 [2018-11-10 06:08:22,297 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 06:08:27,635 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:08:27,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 146 [2018-11-10 06:08:27,637 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:08:27,865 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:08:33,890 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:08:33,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 151 [2018-11-10 06:08:33,957 INFO L477 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 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-10 06:08:33,957 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-10 06:08:34,120 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:08:38,742 INFO L303 Elim1Store]: Index analysis took 187 ms [2018-11-10 06:08:38,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 145 treesize of output 144 [2018-11-10 06:08:38,831 INFO L477 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 0 case distinctions, treesize of input 144 treesize of output 138 [2018-11-10 06:08:38,832 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-10 06:08:39,589 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:08:39,595 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:08:39,596 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:08:39,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 127 treesize of output 155 [2018-11-10 06:08:39,646 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:08:39,779 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:08:40,679 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-10 06:08:43,853 INFO L303 Elim1Store]: Index analysis took 281 ms [2018-11-10 06:08:43,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 142 treesize of output 143 [2018-11-10 06:08:43,973 INFO L477 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 0 case distinctions, treesize of input 141 treesize of output 135 [2018-11-10 06:08:43,973 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-10 06:08:44,926 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:08:44,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 141 [2018-11-10 06:08:44,979 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-10 06:08:45,650 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:08:46,662 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:08:49,214 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 06:08:50,609 INFO L477 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 150 treesize of output 116 [2018-11-10 06:08:50,631 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:08:50,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 100 [2018-11-10 06:08:50,632 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-10 06:08:50,842 INFO L477 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 96 treesize of output 78 [2018-11-10 06:08:50,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-10 06:08:50,850 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-10 06:08:50,927 INFO L477 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 69 treesize of output 64 [2018-11-10 06:08:50,934 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:08:50,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2018-11-10 06:08:50,941 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-10 06:08:50,972 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:08:50,998 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:08:51,041 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:08:51,068 INFO L477 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 150 treesize of output 116 [2018-11-10 06:08:51,081 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:08:51,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 100 [2018-11-10 06:08:51,083 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-10 06:08:51,261 INFO L477 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 96 treesize of output 78 [2018-11-10 06:08:51,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-10 06:08:51,268 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-10 06:08:51,345 INFO L477 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 69 treesize of output 64 [2018-11-10 06:08:51,353 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:08:51,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2018-11-10 06:08:51,360 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-10 06:08:51,390 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:08:51,414 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:08:51,458 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:08:51,564 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 123 [2018-11-10 06:08:51,580 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:08:51,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 120 [2018-11-10 06:08:51,581 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-10 06:08:56,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 117 [2018-11-10 06:08:56,120 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:01,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 110 [2018-11-10 06:09:01,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 98 [2018-11-10 06:09:01,165 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:02,045 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:09:02,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 118 [2018-11-10 06:09:02,047 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:03,003 INFO L477 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 101 treesize of output 104 [2018-11-10 06:09:03,011 INFO L477 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 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-10 06:09:03,011 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:03,050 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:09:03,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 88 [2018-11-10 06:09:03,533 INFO L477 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 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-10 06:09:03,533 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:03,569 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:09:03,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 85 [2018-11-10 06:09:03,798 INFO L477 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 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-10 06:09:03,799 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:03,834 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:09:03,909 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:09:05,812 INFO L303 Elim1Store]: Index analysis took 129 ms [2018-11-10 06:09:05,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 107 [2018-11-10 06:09:05,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 97 [2018-11-10 06:09:05,867 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:06,714 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:09:06,718 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:09:06,719 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 06:09:06,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 89 treesize of output 110 [2018-11-10 06:09:06,720 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:07,685 INFO L477 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 87 treesize of output 78 [2018-11-10 06:09:07,692 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:09:07,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2018-11-10 06:09:07,700 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:07,734 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:09:08,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 93 [2018-11-10 06:09:08,270 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:09:08,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 85 [2018-11-10 06:09:08,278 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:08,367 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:09:08,606 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:09:09,197 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:09:09,491 INFO L477 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 86 treesize of output 97 [2018-11-10 06:09:09,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-10 06:09:09,495 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:09,531 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:09:09,547 INFO L477 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 98 treesize of output 95 [2018-11-10 06:09:09,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:09:09,552 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:09,602 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:09:09,618 INFO L477 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 87 treesize of output 84 [2018-11-10 06:09:09,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:09:09,623 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:09,664 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:09:09,680 INFO L477 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 98 treesize of output 95 [2018-11-10 06:09:09,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:09:09,684 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:09,733 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:09:10,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-10 06:09:10,024 INFO L202 ElimStorePlain]: Needed 68 recursive calls to eliminate 8 variables, input treesize:319, output treesize:261 [2018-11-10 06:09:10,656 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-11-10 06:09:10,675 INFO L477 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 72 treesize of output 66 [2018-11-10 06:09:10,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-11-10 06:09:10,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:10,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-11-10 06:09:10,732 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:10,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2018-11-10 06:09:10,778 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:10,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:09:10,929 INFO L477 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 35 treesize of output 35 [2018-11-10 06:09:10,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-10 06:09:10,932 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:10,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-10 06:09:10,961 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:10,986 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:09:10,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-10 06:09:10,987 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:10,998 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:09:11,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 75 [2018-11-10 06:09:11,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2018-11-10 06:09:11,111 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:11,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2018-11-10 06:09:11,172 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:11,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2018-11-10 06:09:11,224 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:11,267 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:09:11,361 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2018-11-10 06:09:11,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2018-11-10 06:09:11,364 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:11,379 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:09:11,453 INFO L477 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 70 treesize of output 68 [2018-11-10 06:09:11,458 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:09:11,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-11-10 06:09:11,459 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:11,528 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:09:11,591 INFO L477 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 38 treesize of output 38 [2018-11-10 06:09:11,598 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:09:11,600 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:09:11,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-11-10 06:09:11,601 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:11,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-11-10 06:09:11,638 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:11,670 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:09:11,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2018-11-10 06:09:11,673 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:11,694 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:09:11,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-10 06:09:11,727 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 11 variables, input treesize:227, output treesize:30 [2018-11-10 06:09:12,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 06:09:12,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:09:12,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 06:09:12,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:09:12,337 INFO L477 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 15 treesize of output 19 [2018-11-10 06:09:12,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-11-10 06:09:12,340 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:12,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2018-11-10 06:09:12,356 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:12,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 06:09:12,367 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 06:09:12,373 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:09:12,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:09:12,380 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:31, output treesize:1 [2018-11-10 06:09:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 06:09:12,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:09:12,769 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-10 06:09:12,910 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-10 06:09:15,002 WARN L179 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 100 [2018-11-10 06:09:15,877 WARN L179 SmtUtils]: Spent 873.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-10 06:09:16,674 WARN L179 SmtUtils]: Spent 795.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-11-10 06:09:18,749 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 71 [2018-11-10 06:09:26,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:09:26,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 32] total 66 [2018-11-10 06:09:26,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-10 06:09:26,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-10 06:09:26,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=4345, Unknown=24, NotChecked=540, Total=5112 [2018-11-10 06:09:26,926 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 66 states. [2018-11-10 06:09:28,685 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-11-10 06:09:29,342 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2018-11-10 06:09:36,960 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-10 06:09:42,511 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_insert_~last~0.offset (_ BitVec 32)) (sll_insert_~new_node~0.base (_ BitVec 32)) (node_create_~data (_ BitVec 32)) (sll_insert_~snd_to_last~0.offset (_ BitVec 32)) (sll_insert_~last~0.base (_ BitVec 32)) (sll_insert_~new_node~0.offset (_ BitVec 32))) (let ((.cse5 (bvadd node_create_~temp~0.offset (_ bv4 32)))) (let ((.cse7 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) .cse5 (_ bv0 32))))) (let ((.cse1 (bvadd sll_insert_~new_node~0.offset (_ bv4 32))) (.cse3 (select (select .cse7 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)) (.cse4 (bvadd sll_insert_~snd_to_last~0.offset (_ bv4 32)))) (and (= (let ((.cse0 (let ((.cse2 (store |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) .cse5 (_ bv0 32))))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 sll_insert_~new_node~0.offset))))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) .cse1 sll_insert_~last~0.offset))) |c_#memory_$Pointer$.offset|) (= (let ((.cse6 (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 sll_insert_~new_node~0.base)))) (store .cse6 sll_insert_~new_node~0.base (store (select .cse6 sll_insert_~new_node~0.base) .cse1 sll_insert_~last~0.base))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base)) (= (store |c_old(#memory_int)| sll_insert_~new_node~0.base (store (select |c_old(#memory_int)| sll_insert_~new_node~0.base) node_create_~temp~0.offset node_create_~data)) |c_#memory_int|)))))) (exists ((sll_insert_~last~0.offset (_ BitVec 32)) (sll_insert_~new_node~0.base (_ BitVec 32)) (node_create_~data (_ BitVec 32)) (sll_insert_~last~0.base (_ BitVec 32))) (let ((.cse9 (store |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)))) (.cse13 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32))))) (let ((.cse10 (select (select .cse13 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)) (.cse11 (bvadd (select (select .cse9 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|) (_ bv4 32)))) (and (= (store |c_old(#memory_int)| sll_insert_~new_node~0.base (store (select |c_old(#memory_int)| sll_insert_~new_node~0.base) (_ bv0 32) node_create_~data)) |c_#memory_int|) (= (let ((.cse8 (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 (_ bv0 32))))) (store .cse8 sll_insert_~new_node~0.base (store (select .cse8 sll_insert_~new_node~0.base) (_ bv4 32) sll_insert_~last~0.offset))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse12 (store .cse13 .cse10 (store (select .cse13 .cse10) .cse11 sll_insert_~new_node~0.base)))) (store .cse12 sll_insert_~new_node~0.base (store (select .cse12 sll_insert_~new_node~0.base) (_ bv4 32) sll_insert_~last~0.base)))) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base))))))) is different from true [2018-11-10 06:09:42,883 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-11-10 06:09:43,331 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2018-11-10 06:09:43,905 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2018-11-10 06:09:44,639 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2018-11-10 06:09:45,191 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2018-11-10 06:09:46,066 WARN L179 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2018-11-10 06:09:46,577 WARN L179 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2018-11-10 06:09:46,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:09:46,776 INFO L93 Difference]: Finished difference Result 137 states and 157 transitions. [2018-11-10 06:09:46,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-10 06:09:46,781 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 83 [2018-11-10 06:09:46,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:09:46,781 INFO L225 Difference]: With dead ends: 137 [2018-11-10 06:09:46,781 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 06:09:46,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2563 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=523, Invalid=10165, Unknown=44, NotChecked=1040, Total=11772 [2018-11-10 06:09:46,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 06:09:46,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 06:09:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 06:09:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 06:09:46,783 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2018-11-10 06:09:46,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:09:46,783 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:09:46,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-10 06:09:46,783 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 06:09:46,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 06:09:46,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 06:09:47,164 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2018-11-10 06:09:47,553 WARN L179 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2018-11-10 06:09:47,832 WARN L179 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2018-11-10 06:09:48,124 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2018-11-10 06:09:48,332 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2018-11-10 06:09:48,334 INFO L425 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-11-10 06:09:48,334 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 560 562) no Hoare annotation was computed. [2018-11-10 06:09:48,334 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 560 562) the Hoare annotation is: true [2018-11-10 06:09:48,334 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 560 562) no Hoare annotation was computed. [2018-11-10 06:09:48,334 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 06:09:48,334 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-11-10 06:09:48,334 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 06:09:48,334 INFO L425 ceAbstractionStarter]: For program point L584(line 584) no Hoare annotation was computed. [2018-11-10 06:09:48,334 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-10 06:09:48,334 INFO L425 ceAbstractionStarter]: For program point L584-1(line 584) no Hoare annotation was computed. [2018-11-10 06:09:48,334 INFO L425 ceAbstractionStarter]: For program point L583-1(line 583) no Hoare annotation was computed. [2018-11-10 06:09:48,334 INFO L425 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 581 587) no Hoare annotation was computed. [2018-11-10 06:09:48,334 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 586) no Hoare annotation was computed. [2018-11-10 06:09:48,334 INFO L428 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 581 587) the Hoare annotation is: true [2018-11-10 06:09:48,334 INFO L428 ceAbstractionStarter]: At program point L582-3(lines 582 586) the Hoare annotation is: true [2018-11-10 06:09:48,334 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 581 587) no Hoare annotation was computed. [2018-11-10 06:09:48,335 INFO L425 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 63 67) no Hoare annotation was computed. [2018-11-10 06:09:48,335 INFO L425 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 63 67) no Hoare annotation was computed. [2018-11-10 06:09:48,335 INFO L425 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 63 67) no Hoare annotation was computed. [2018-11-10 06:09:48,335 INFO L425 ceAbstractionStarter]: For program point L576(line 576) no Hoare annotation was computed. [2018-11-10 06:09:48,335 INFO L421 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (let ((.cse0 (= |sll_create_#in~data| sll_create_~data)) (.cse1 (or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32))))) (or (and .cse0 (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) .cse1) (and .cse0 (and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= sll_create_~head~0.base (_ bv0 32))) .cse1 (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) sll_create_~new_head~0.base))) (= (_ bv0 32) sll_create_~head~0.offset) (= (select (select |#memory_int| sll_create_~new_head~0.base) (_ bv0 32)) |sll_create_#in~data|) (= |sll_create_#in~data| (select (select |#memory_int| sll_create_~head~0.base) (_ bv0 32)))))) [2018-11-10 06:09:48,335 INFO L425 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-11-10 06:09:48,335 INFO L425 ceAbstractionStarter]: For program point sll_createEXIT(lines 572 580) no Hoare annotation was computed. [2018-11-10 06:09:48,335 INFO L425 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-11-10 06:09:48,335 INFO L425 ceAbstractionStarter]: For program point L574-1(lines 574 578) no Hoare annotation was computed. [2018-11-10 06:09:48,335 INFO L425 ceAbstractionStarter]: For program point L574-3(lines 574 578) no Hoare annotation was computed. [2018-11-10 06:09:48,335 INFO L421 ceAbstractionStarter]: At program point L574-4(lines 574 578) the Hoare annotation is: (let ((.cse0 (= |sll_create_#in~data| sll_create_~data))) (or (and .cse0 (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (and .cse0 (and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= sll_create_~head~0.base (_ bv0 32))) (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) sll_create_~new_head~0.base))) (= (_ bv0 32) sll_create_~head~0.offset) (= (select (select |#memory_int| sll_create_~new_head~0.base) (_ bv0 32)) |sll_create_#in~data|) (= |sll_create_#in~data| (select (select |#memory_int| sll_create_~head~0.base) (_ bv0 32)))))) [2018-11-10 06:09:48,335 INFO L425 ceAbstractionStarter]: For program point L574-5(lines 574 578) no Hoare annotation was computed. [2018-11-10 06:09:48,335 INFO L421 ceAbstractionStarter]: At program point sll_createENTRY(lines 572 580) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-10 06:09:48,335 INFO L425 ceAbstractionStarter]: For program point sll_createFINAL(lines 572 580) no Hoare annotation was computed. [2018-11-10 06:09:48,335 INFO L425 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 68 72) no Hoare annotation was computed. [2018-11-10 06:09:48,335 INFO L425 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 68 72) no Hoare annotation was computed. [2018-11-10 06:09:48,335 INFO L425 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 68 72) no Hoare annotation was computed. [2018-11-10 06:09:48,335 INFO L421 ceAbstractionStarter]: At program point sll_insertENTRY(lines 588 603) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-10 06:09:48,335 INFO L425 ceAbstractionStarter]: For program point L591(line 591) no Hoare annotation was computed. [2018-11-10 06:09:48,335 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-10 06:09:48,336 INFO L421 ceAbstractionStarter]: At program point L589(line 589) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= sll_insert_~index |sll_insert_#in~index|) (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-10 06:09:48,336 INFO L425 ceAbstractionStarter]: For program point sll_insertEXIT(lines 588 603) no Hoare annotation was computed. [2018-11-10 06:09:48,336 INFO L425 ceAbstractionStarter]: For program point L589-1(line 589) no Hoare annotation was computed. [2018-11-10 06:09:48,336 INFO L425 ceAbstractionStarter]: For program point L600(line 600) no Hoare annotation was computed. [2018-11-10 06:09:48,336 INFO L425 ceAbstractionStarter]: For program point L600-1(lines 597 601) no Hoare annotation was computed. [2018-11-10 06:09:48,336 INFO L425 ceAbstractionStarter]: For program point L598(line 598) no Hoare annotation was computed. [2018-11-10 06:09:48,336 INFO L425 ceAbstractionStarter]: For program point L594(line 594) no Hoare annotation was computed. [2018-11-10 06:09:48,336 INFO L425 ceAbstractionStarter]: For program point L594-1(line 594) no Hoare annotation was computed. [2018-11-10 06:09:48,336 INFO L425 ceAbstractionStarter]: For program point L592-1(lines 592 596) no Hoare annotation was computed. [2018-11-10 06:09:48,336 INFO L421 ceAbstractionStarter]: At program point L592-3(lines 592 596) the Hoare annotation is: (and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))) |#memory_$Pointer$.base|)) (= sll_insert_~new_node~0.offset (_ bv0 32)) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= (store |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (exists ((node_create_~data (_ BitVec 32))) (= (store |old(#memory_int)| sll_insert_~new_node~0.base (store (select |old(#memory_int)| sll_insert_~new_node~0.base) (_ bv0 32) node_create_~data)) |#memory_int|)) (= (_ bv0 1) (select |old(#valid)| sll_insert_~new_node~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)))) (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (not (= (_ bv0 32) sll_insert_~new_node~0.base))) [2018-11-10 06:09:48,336 INFO L425 ceAbstractionStarter]: For program point L592-4(lines 588 603) no Hoare annotation was computed. [2018-11-10 06:09:48,336 INFO L425 ceAbstractionStarter]: For program point sll_insertFINAL(lines 588 603) no Hoare annotation was computed. [2018-11-10 06:09:48,336 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 06:09:48,336 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 06:09:48,336 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 06:09:48,336 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 06:09:48,336 INFO L425 ceAbstractionStarter]: For program point L609(line 609) no Hoare annotation was computed. [2018-11-10 06:09:48,337 INFO L421 ceAbstractionStarter]: At program point L611-3(lines 611 618) the Hoare annotation is: (let ((.cse0 (= |main_~#s~0.offset| (_ bv0 32))) (.cse1 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))) (or (and .cse0 .cse1 (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32))) (and (let ((.cse9 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse6 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse3 (= (select (select |#memory_int| .cse6) (_ bv0 32)) main_~data~0)) (.cse2 (select |#memory_$Pointer$.offset| .cse6)) (.cse8 (= .cse9 (_ bv0 32)))) (or (and (= (_ bv0 32) (select .cse2 (_ bv4 32))) .cse3 (exists ((sll_insert_~new_node~0.base (_ BitVec 32))) (let ((.cse4 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse5 (select (select |#memory_$Pointer$.offset| sll_insert_~new_node~0.base) |main_~#s~0.offset|))) (and (not (= .cse4 sll_insert_~new_node~0.base)) (= (_ bv0 32) .cse5) (= (select (select |#memory_$Pointer$.base| .cse4) (bvadd .cse5 (_ bv4 32))) sll_insert_~new_node~0.base)))) (= |main_~#s~0.base| .cse6)) (let ((.cse7 (bvadd .cse9 (_ bv4 32)))) (and (not (= (select (select |#memory_$Pointer$.base| .cse6) .cse7) .cse6)) .cse8 .cse3 (= (_ bv0 32) (select .cse2 .cse7)))) (and (exists ((v_DerPreprocessor_4 (_ BitVec 32))) (let ((.cse11 (select |#memory_$Pointer$.base| v_DerPreprocessor_4))) (let ((.cse10 (select .cse11 |main_~#s~0.offset|)) (.cse12 (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (and (= (select (select |#memory_int| .cse10) (_ bv0 32)) main_~data~0) (not (= |main_~#s~0.base| .cse10)) (= .cse10 v_DerPreprocessor_4) (= (select .cse11 .cse12) |main_~#s~0.base|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse10) .cse12)))))) .cse8)))) .cse0 .cse1))) [2018-11-10 06:09:48,337 INFO L425 ceAbstractionStarter]: For program point L607(line 607) no Hoare annotation was computed. [2018-11-10 06:09:48,337 INFO L425 ceAbstractionStarter]: For program point L611-4(lines 604 626) no Hoare annotation was computed. [2018-11-10 06:09:48,337 INFO L421 ceAbstractionStarter]: At program point L607-1(line 607) the Hoare annotation is: (and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-10 06:09:48,337 INFO L425 ceAbstractionStarter]: For program point L607-2(line 607) no Hoare annotation was computed. [2018-11-10 06:09:48,337 INFO L425 ceAbstractionStarter]: For program point L607-3(line 607) no Hoare annotation was computed. [2018-11-10 06:09:48,337 INFO L425 ceAbstractionStarter]: For program point L607-4(line 607) no Hoare annotation was computed. [2018-11-10 06:09:48,337 INFO L425 ceAbstractionStarter]: For program point L607-5(line 607) no Hoare annotation was computed. [2018-11-10 06:09:48,337 INFO L425 ceAbstractionStarter]: For program point L607-6(line 607) no Hoare annotation was computed. [2018-11-10 06:09:48,337 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 604 626) no Hoare annotation was computed. [2018-11-10 06:09:48,337 INFO L425 ceAbstractionStarter]: For program point L607-7(line 607) no Hoare annotation was computed. [2018-11-10 06:09:48,337 INFO L425 ceAbstractionStarter]: For program point L622(line 622) no Hoare annotation was computed. [2018-11-10 06:09:48,337 INFO L428 ceAbstractionStarter]: At program point L622-1(line 622) the Hoare annotation is: true [2018-11-10 06:09:48,337 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 604 626) no Hoare annotation was computed. [2018-11-10 06:09:48,337 INFO L421 ceAbstractionStarter]: At program point L620(lines 604 626) the Hoare annotation is: (let ((.cse11 (= |main_~#s~0.offset| (_ bv0 32))) (.cse12 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))) (or (and (let ((.cse8 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse10 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse3 (= .cse10 (_ bv0 32))) (.cse5 (= (select (select |#memory_int| .cse8) (_ bv0 32)) main_~data~0)) (.cse4 (select |#memory_$Pointer$.offset| .cse8))) (or (and (exists ((v_DerPreprocessor_4 (_ BitVec 32))) (let ((.cse1 (select |#memory_$Pointer$.base| v_DerPreprocessor_4))) (let ((.cse0 (select .cse1 |main_~#s~0.offset|)) (.cse2 (bvadd (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv4 32)))) (and (= (select (select |#memory_int| .cse0) (_ bv0 32)) main_~data~0) (not (= |main_~#s~0.base| .cse0)) (= .cse0 v_DerPreprocessor_4) (= (select .cse1 .cse2) |main_~#s~0.base|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse0) .cse2)))))) .cse3) (and (= (_ bv0 32) (select .cse4 (_ bv4 32))) .cse5 (exists ((sll_insert_~new_node~0.base (_ BitVec 32))) (let ((.cse6 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse7 (select (select |#memory_$Pointer$.offset| sll_insert_~new_node~0.base) |main_~#s~0.offset|))) (and (not (= .cse6 sll_insert_~new_node~0.base)) (= (_ bv0 32) .cse7) (= (select (select |#memory_$Pointer$.base| .cse6) (bvadd .cse7 (_ bv4 32))) sll_insert_~new_node~0.base)))) (= |main_~#s~0.base| .cse8)) (let ((.cse9 (bvadd .cse10 (_ bv4 32)))) (and (not (= (select (select |#memory_$Pointer$.base| .cse8) .cse9) .cse8)) .cse3 .cse5 (= (_ bv0 32) (select .cse4 .cse9))))))) .cse11 .cse12) (and .cse11 .cse12 (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32))))) [2018-11-10 06:09:48,337 INFO L425 ceAbstractionStarter]: For program point L622-2(line 622) no Hoare annotation was computed. [2018-11-10 06:09:48,338 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2018-11-10 06:09:48,338 INFO L425 ceAbstractionStarter]: For program point L612(line 612) no Hoare annotation was computed. [2018-11-10 06:09:48,338 INFO L425 ceAbstractionStarter]: For program point L612-1(line 612) no Hoare annotation was computed. [2018-11-10 06:09:48,338 INFO L421 ceAbstractionStarter]: At program point L608(line 608) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_int| .cse0) (_ bv0 32)) main_~data~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv0 32) .cse0)) (= (_ bv1 1) (select |#valid| .cse0)))) [2018-11-10 06:09:48,338 INFO L425 ceAbstractionStarter]: For program point L608-1(line 608) no Hoare annotation was computed. [2018-11-10 06:09:48,338 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 604 626) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-10 06:09:48,338 INFO L425 ceAbstractionStarter]: For program point L613(line 613) no Hoare annotation was computed. [2018-11-10 06:09:48,338 INFO L425 ceAbstractionStarter]: For program point L613-1(lines 613 615) no Hoare annotation was computed. [2018-11-10 06:09:48,338 INFO L425 ceAbstractionStarter]: For program point L611-1(lines 611 618) no Hoare annotation was computed. [2018-11-10 06:09:48,338 INFO L421 ceAbstractionStarter]: At program point node_createENTRY(lines 563 571) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-10 06:09:48,338 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-10 06:09:48,338 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-10 06:09:48,338 INFO L428 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-11-10 06:09:48,338 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-11-10 06:09:48,338 INFO L425 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-11-10 06:09:48,338 INFO L425 ceAbstractionStarter]: For program point L564(line 564) no Hoare annotation was computed. [2018-11-10 06:09:48,338 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-11-10 06:09:48,339 INFO L425 ceAbstractionStarter]: For program point L564-1(line 564) no Hoare annotation was computed. [2018-11-10 06:09:48,339 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-11-10 06:09:48,346 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,347 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,348 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,348 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,348 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,348 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,348 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,349 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,349 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,349 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,349 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,349 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,350 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,350 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,350 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,350 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,351 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,352 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,352 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,352 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,352 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,352 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,353 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,353 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,353 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,353 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,353 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,353 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,354 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,354 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,354 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,354 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,354 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,356 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,358 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,360 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,360 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,360 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,360 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,360 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,360 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,361 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,361 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,361 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,361 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,364 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,364 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,364 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,365 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,365 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,365 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,365 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,365 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,365 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,366 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,366 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,366 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,366 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,366 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,366 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,366 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,367 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,367 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,367 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,367 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,367 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,367 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,367 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,367 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,368 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,368 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,368 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,368 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,368 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,368 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,368 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,368 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,368 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,368 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,369 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,369 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,369 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,369 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,369 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,369 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,369 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,371 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,372 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,372 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,372 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,372 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,372 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,372 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,372 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,372 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,373 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,374 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,374 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,374 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,375 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,375 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,375 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,375 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,375 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,376 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,376 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,376 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,376 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,376 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,377 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,377 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,377 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,377 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,378 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,378 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,379 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] [2018-11-10 06:09:48,379 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,379 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,379 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,379 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,379 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~data,QUANTIFIED] [2018-11-10 06:09:48,379 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,379 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,379 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,381 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,381 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,381 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] [2018-11-10 06:09:48,381 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,381 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,381 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,382 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,382 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~data,QUANTIFIED] [2018-11-10 06:09:48,382 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,382 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,382 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,382 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,382 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,382 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,382 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,382 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,383 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,383 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,383 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,383 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,383 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,383 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,383 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,383 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,384 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,384 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,385 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,385 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,385 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,385 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,387 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,387 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,388 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,388 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,388 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,388 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,388 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,389 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,389 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,389 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,389 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,389 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,390 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,390 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,390 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,390 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,390 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,390 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,391 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,391 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,391 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,391 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,391 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,392 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,392 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,392 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,392 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,392 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,392 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,393 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,393 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,393 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,393 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,393 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,393 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,393 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,395 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,395 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,395 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,395 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,396 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,396 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,396 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,397 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,397 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,397 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,397 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,397 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,398 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,398 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,398 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,398 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,398 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,398 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,398 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,398 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,398 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,399 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,399 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,399 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,399 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,399 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,399 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,399 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,399 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,399 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,399 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,400 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,400 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,400 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,400 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,400 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,400 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,400 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,400 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,400 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,401 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,401 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,401 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,401 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,401 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,401 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,401 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,401 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,401 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,401 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,401 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,402 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,402 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,402 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,402 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,402 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,402 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,402 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,402 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,402 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,402 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,402 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,403 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,403 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:09:48 BoogieIcfgContainer [2018-11-10 06:09:48,404 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 06:09:48,404 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:09:48,404 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:09:48,404 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:09:48,405 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:05:38" (3/4) ... [2018-11-10 06:09:48,407 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 06:09:48,412 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exit [2018-11-10 06:09:48,412 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 06:09:48,412 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2018-11-10 06:09:48,412 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-10 06:09:48,412 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-10 06:09:48,412 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-11-10 06:09:48,412 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_insert [2018-11-10 06:09:48,412 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 06:09:48,412 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-11-10 06:09:48,415 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2018-11-10 06:09:48,416 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 06:09:48,416 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 06:09:48,433 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(data) == data && \valid == \old(\valid)) && \old(len) == len) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$) || ((((\old(data) == data && (((1bv1 == \valid[head] && new_head == 0bv32) && !(head == 0bv32)) && ~bvadd64(\valid[new_head], 1bv1) == 0bv1) && !(0bv32 == new_head)) && 0bv32 == head) && unknown-#memory_int-unknown[new_head][0bv32] == \old(data)) && \old(data) == unknown-#memory_int-unknown[head][0bv32]) [2018-11-10 06:09:48,433 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(data, 4294967295bv32) == 0bv32) || (((((((0bv32 == #memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32] && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][0bv32] == data) && (\exists sll_insert_~new_node~0.base : bv32 :: (!(#memory_$Pointer$[s][s] == sll_insert_~new_node~0.base) && 0bv32 == #memory_$Pointer$[sll_insert_~new_node~0.base][s]) && #memory_$Pointer$[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[sll_insert_~new_node~0.base][s], 4bv32)] == sll_insert_~new_node~0.base)) && s == #memory_$Pointer$[s][s]) || (((!(#memory_$Pointer$[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)] == #memory_$Pointer$[s][s]) && #memory_$Pointer$[s][s] == 0bv32) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][0bv32] == data) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)])) || ((\exists v_DerPreprocessor_4 : bv32 :: (((unknown-#memory_int-unknown[#memory_$Pointer$[v_DerPreprocessor_4][s]][0bv32] == data && !(s == #memory_$Pointer$[v_DerPreprocessor_4][s])) && #memory_$Pointer$[v_DerPreprocessor_4][s] == v_DerPreprocessor_4) && #memory_$Pointer$[v_DerPreprocessor_4][~bvadd64(#memory_$Pointer$[s][s], 4bv32)] == s) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[v_DerPreprocessor_4][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)]) && #memory_$Pointer$[s][s] == 0bv32)) && s == 0bv32) && ~bvadd64(len, 4294967294bv32) == 0bv32) [2018-11-10 06:09:48,434 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\exists v_DerPreprocessor_4 : bv32 :: (((unknown-#memory_int-unknown[#memory_$Pointer$[v_DerPreprocessor_4][s]][0bv32] == data && !(s == #memory_$Pointer$[v_DerPreprocessor_4][s])) && #memory_$Pointer$[v_DerPreprocessor_4][s] == v_DerPreprocessor_4) && #memory_$Pointer$[v_DerPreprocessor_4][~bvadd64(#memory_$Pointer$[s][s], 4bv32)] == s) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[v_DerPreprocessor_4][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)]) && #memory_$Pointer$[s][s] == 0bv32) || (((0bv32 == #memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32] && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][0bv32] == data) && (\exists sll_insert_~new_node~0.base : bv32 :: (!(#memory_$Pointer$[s][s] == sll_insert_~new_node~0.base) && 0bv32 == #memory_$Pointer$[sll_insert_~new_node~0.base][s]) && #memory_$Pointer$[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[sll_insert_~new_node~0.base][s], 4bv32)] == sll_insert_~new_node~0.base)) && s == #memory_$Pointer$[s][s])) || (((!(#memory_$Pointer$[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)] == #memory_$Pointer$[s][s]) && #memory_$Pointer$[s][s] == 0bv32) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][0bv32] == data) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)])) && s == 0bv32) && ~bvadd64(len, 4294967294bv32) == 0bv32) || ((s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(data, 4294967295bv32) == 0bv32) [2018-11-10 06:09:48,434 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\exists node_create_~temp~0.offset : bv32 :: \old(#memory_$Pointer$)[new_node := \old(#memory_$Pointer$)[new_node][~bvadd64(node_create_~temp~0.offset, 4bv32) := 0bv32]] == #memory_$Pointer$) && new_node == 0bv32) && head == head) && \old(#memory_$Pointer$)[new_node := \old(#memory_$Pointer$)[new_node][4bv32 := 0bv32]] == #memory_$Pointer$) && (\exists node_create_~data : bv32 :: \old(unknown-#memory_int-unknown)[new_node := \old(unknown-#memory_int-unknown)[new_node][0bv32 := node_create_~data]] == unknown-#memory_int-unknown)) && 0bv1 == \old(\valid)[new_node]) && #memory_$Pointer$ == \old(#memory_$Pointer$)[new_node := \old(#memory_$Pointer$)[new_node][4bv32 := 0bv32]]) && head == head) && !(0bv32 == new_node) [2018-11-10 06:09:48,447 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5f948d9b-469e-4dbe-9765-13a317cd966d/bin-2019/uautomizer/witness.graphml [2018-11-10 06:09:48,447 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:09:48,447 INFO L168 Benchmark]: Toolchain (without parser) took 250481.89 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 274.7 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -124.5 MB). Peak memory consumption was 150.2 MB. Max. memory is 11.5 GB. [2018-11-10 06:09:48,448 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:09:48,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.72 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 917.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 06:09:48,448 INFO L168 Benchmark]: Boogie Preprocessor took 96.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 917.5 MB in the beginning and 1.1 GB in the end (delta: -212.1 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2018-11-10 06:09:48,448 INFO L168 Benchmark]: RCFGBuilder took 458.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.2 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. [2018-11-10 06:09:48,448 INFO L168 Benchmark]: TraceAbstraction took 249497.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 132.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -6.7 MB). Peak memory consumption was 125.4 MB. Max. memory is 11.5 GB. [2018-11-10 06:09:48,448 INFO L168 Benchmark]: Witness Printer took 42.81 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2018-11-10 06:09:48,449 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 382.72 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 917.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 96.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 917.5 MB in the beginning and 1.1 GB in the end (delta: -212.1 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 458.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.2 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 249497.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 132.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -6.7 MB). Peak memory consumption was 125.4 MB. Max. memory is 11.5 GB. * Witness Printer took 42.81 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~data,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~data,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$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_$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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$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_$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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$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_$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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 624]: 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: 611]: Loop Invariant [2018-11-10 06:09:48,490 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,490 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,490 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,491 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,501 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,501 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,502 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,502 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,502 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,502 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,502 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,502 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,502 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,502 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,502 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,502 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,502 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,503 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,503 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,503 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,503 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,503 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,503 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,505 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,505 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,505 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,505 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,505 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,505 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,505 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,506 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,506 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,506 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,506 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,506 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,506 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,506 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,506 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,506 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,506 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,506 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,506 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,507 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,507 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,507 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,507 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,507 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,507 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,509 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,509 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,509 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,509 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,509 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,509 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,509 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,509 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,510 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,510 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,510 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,510 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,510 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,510 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,510 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,510 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,510 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,510 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,510 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,511 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,511 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,511 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,511 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,511 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,511 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,512 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,512 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,512 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,512 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,522 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,522 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,522 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,522 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,522 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,522 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,522 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,523 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,523 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,523 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,523 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,523 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,523 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,523 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,523 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,523 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,523 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,523 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,523 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,524 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,535 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,536 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,536 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,536 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,536 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,536 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,536 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,536 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,536 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,536 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,536 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,537 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,537 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,537 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,537 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,537 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,537 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,537 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,537 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,537 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,537 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,537 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,537 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,538 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,538 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,538 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,538 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,538 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,538 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,538 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,538 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,538 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,549 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,549 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,550 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,550 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,550 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(data, 4294967295bv32) == 0bv32) || (((((((0bv32 == #memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32] && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][0bv32] == data) && (\exists sll_insert_~new_node~0.base : bv32 :: (!(#memory_$Pointer$[s][s] == sll_insert_~new_node~0.base) && 0bv32 == #memory_$Pointer$[sll_insert_~new_node~0.base][s]) && #memory_$Pointer$[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[sll_insert_~new_node~0.base][s], 4bv32)] == sll_insert_~new_node~0.base)) && s == #memory_$Pointer$[s][s]) || (((!(#memory_$Pointer$[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)] == #memory_$Pointer$[s][s]) && #memory_$Pointer$[s][s] == 0bv32) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][0bv32] == data) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)])) || ((\exists v_DerPreprocessor_4 : bv32 :: (((unknown-#memory_int-unknown[#memory_$Pointer$[v_DerPreprocessor_4][s]][0bv32] == data && !(s == #memory_$Pointer$[v_DerPreprocessor_4][s])) && #memory_$Pointer$[v_DerPreprocessor_4][s] == v_DerPreprocessor_4) && #memory_$Pointer$[v_DerPreprocessor_4][~bvadd64(#memory_$Pointer$[s][s], 4bv32)] == s) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[v_DerPreprocessor_4][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)]) && #memory_$Pointer$[s][s] == 0bv32)) && s == 0bv32) && ~bvadd64(len, 4294967294bv32) == 0bv32) - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 574]: Loop Invariant [2018-11-10 06:09:48,550 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,550 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,550 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,550 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,551 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,551 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,551 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,551 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,551 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,551 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,551 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,551 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,552 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,568 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,569 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,569 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,569 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,569 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,569 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,569 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,569 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,569 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,569 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,569 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((\old(data) == data && \valid == \old(\valid)) && \old(len) == len) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$) || ((((\old(data) == data && (((1bv1 == \valid[head] && new_head == 0bv32) && !(head == 0bv32)) && ~bvadd64(\valid[new_head], 1bv1) == 0bv1) && !(0bv32 == new_head)) && 0bv32 == head) && unknown-#memory_int-unknown[new_head][0bv32] == \old(data)) && \old(data) == unknown-#memory_int-unknown[head][0bv32]) - InvariantResult [Line: 592]: Loop Invariant [2018-11-10 06:09:48,569 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,570 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,570 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] [2018-11-10 06:09:48,570 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,570 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,570 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,570 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,570 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~data,QUANTIFIED] [2018-11-10 06:09:48,570 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,586 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,586 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,586 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,587 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,587 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,587 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,587 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,587 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,587 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,587 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,588 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,588 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,588 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,588 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,588 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,588 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,588 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] [2018-11-10 06:09:48,589 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,589 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,589 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,589 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,589 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~data,QUANTIFIED] [2018-11-10 06:09:48,589 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,590 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,590 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,603 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,603 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,603 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,603 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,604 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,604 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,604 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,604 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,604 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,604 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,604 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,604 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((\exists node_create_~temp~0.offset : bv32 :: \old(#memory_$Pointer$)[new_node := \old(#memory_$Pointer$)[new_node][~bvadd64(node_create_~temp~0.offset, 4bv32) := 0bv32]] == #memory_$Pointer$) && new_node == 0bv32) && head == head) && \old(#memory_$Pointer$)[new_node := \old(#memory_$Pointer$)[new_node][4bv32 := 0bv32]] == #memory_$Pointer$) && (\exists node_create_~data : bv32 :: \old(unknown-#memory_int-unknown)[new_node := \old(unknown-#memory_int-unknown)[new_node][0bv32 := node_create_~data]] == unknown-#memory_int-unknown)) && 0bv1 == \old(\valid)[new_node]) && #memory_$Pointer$ == \old(#memory_$Pointer$)[new_node := \old(#memory_$Pointer$)[new_node][4bv32 := 0bv32]]) && head == head) && !(0bv32 == new_node) - InvariantResult [Line: 604]: Loop Invariant [2018-11-10 06:09:48,605 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,605 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,605 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,605 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,605 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,605 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,605 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,605 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,606 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,606 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,617 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,617 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,617 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,617 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,617 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,618 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,618 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,618 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,618 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,618 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,618 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,618 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,618 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,618 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,618 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,618 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,618 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,619 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,619 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,632 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,632 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,632 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,633 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,633 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,633 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,633 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,633 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,633 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,633 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,633 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,633 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,633 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,633 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,633 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,634 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,634 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,634 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,634 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,634 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,634 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,634 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,634 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,634 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,634 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,634 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,634 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,635 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,635 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,635 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,648 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,648 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,649 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,649 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,649 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,649 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,649 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,649 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,649 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,649 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,649 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,649 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,650 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,650 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,650 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,650 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,650 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,650 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,650 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,650 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,650 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-11-10 06:09:48,650 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,650 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,650 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,676 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,676 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,676 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,676 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,676 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,676 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,676 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,676 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,677 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,677 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,677 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_insert_~new_node~0.base,QUANTIFIED] [2018-11-10 06:09:48,677 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,677 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,677 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,677 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,677 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,677 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,677 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,677 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,706 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 06:09:48,706 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 06:09:48,706 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,706 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,706 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,706 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,706 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,706 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,706 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,706 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,707 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,707 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,707 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,707 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,707 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,707 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,707 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,707 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,707 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,707 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,707 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,707 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,707 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:09:48,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 06:09:48,708 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((\exists v_DerPreprocessor_4 : bv32 :: (((unknown-#memory_int-unknown[#memory_$Pointer$[v_DerPreprocessor_4][s]][0bv32] == data && !(s == #memory_$Pointer$[v_DerPreprocessor_4][s])) && #memory_$Pointer$[v_DerPreprocessor_4][s] == v_DerPreprocessor_4) && #memory_$Pointer$[v_DerPreprocessor_4][~bvadd64(#memory_$Pointer$[s][s], 4bv32)] == s) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[v_DerPreprocessor_4][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)]) && #memory_$Pointer$[s][s] == 0bv32) || (((0bv32 == #memory_$Pointer$[#memory_$Pointer$[s][s]][4bv32] && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][0bv32] == data) && (\exists sll_insert_~new_node~0.base : bv32 :: (!(#memory_$Pointer$[s][s] == sll_insert_~new_node~0.base) && 0bv32 == #memory_$Pointer$[sll_insert_~new_node~0.base][s]) && #memory_$Pointer$[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[sll_insert_~new_node~0.base][s], 4bv32)] == sll_insert_~new_node~0.base)) && s == #memory_$Pointer$[s][s])) || (((!(#memory_$Pointer$[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)] == #memory_$Pointer$[s][s]) && #memory_$Pointer$[s][s] == 0bv32) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][0bv32] == data) && 0bv32 == #memory_$Pointer$[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)])) && s == 0bv32) && ~bvadd64(len, 4294967294bv32) == 0bv32) || ((s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(data, 4294967295bv32) == 0bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 88 locations, 1 error locations. SAFE Result, 249.3s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 49.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 458 SDtfs, 665 SDslu, 3984 SDs, 0 SdLazy, 4521 SolverSat, 153 SolverUnsat, 426 SolverUnknown, 0 SolverNotchecked, 28.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1026 GetRequests, 744 SyntacticMatches, 1 SemanticMatches, 281 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 4360 ImplicationChecksByTransitivity, 59.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=7, 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, 8 MinimizatonAttempts, 89 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 49 PreInvPairs, 73 NumberOfFragments, 797 HoareAnnotationTreeSize, 49 FomulaSimplifications, 7720 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 20 FomulaSimplificationsInter, 1310 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 196.5s InterpolantComputationTime, 751 NumberOfCodeBlocks, 719 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 878 ConstructedInterpolants, 160 QuantifiedInterpolants, 839856 SizeOfPredicates, 160 NumberOfNonLiveVariables, 1985 ConjunctsInSsa, 337 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 205/340 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...