./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal_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_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6054e98f999cfedecdcceeeadabf7a119475d890 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6054e98f999cfedecdcceeeadabf7a119475d890 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:50:50,182 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:50:50,184 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:50:50,197 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:50:50,199 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:50:50,200 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:50:50,201 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:50:50,202 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:50:50,203 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:50:50,204 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:50:50,205 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:50:50,205 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:50:50,205 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:50:50,206 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:50:50,208 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:50:50,208 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:50:50,209 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:50:50,210 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:50:50,212 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:50:50,213 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:50:50,214 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:50:50,215 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:50:50,222 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:50:50,222 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:50:50,222 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:50:50,223 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:50:50,225 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:50:50,229 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:50:50,230 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:50:50,231 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:50:50,231 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:50:50,231 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:50:50,232 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:50:50,232 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:50:50,232 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:50:50,233 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:50:50,233 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 21:50:50,251 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:50:50,253 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:50:50,254 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:50:50,255 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 21:50:50,255 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 21:50:50,255 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 21:50:50,255 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 21:50:50,256 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 21:50:50,256 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 21:50:50,256 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 21:50:50,256 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 21:50:50,257 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:50:50,259 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:50:50,259 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:50:50,259 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:50:50,259 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:50:50,259 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:50:50,259 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:50:50,260 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:50:50,260 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:50:50,260 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:50:50,260 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:50:50,260 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:50:50,260 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:50:50,260 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:50:50,261 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:50:50,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:50:50,261 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:50:50,261 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:50:50,261 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:50:50,261 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 21:50:50,262 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:50:50,262 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:50:50,262 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:50:50,262 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan 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 -> Taipan 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 -> 6054e98f999cfedecdcceeeadabf7a119475d890 [2018-10-26 21:50:50,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:50:50,305 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:50:50,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:50:50,310 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:50:50,310 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:50:50,310 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-10-26 21:50:50,370 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/data/a78e24c4d/e46afb622b5e46bbbdf7fe3cff95ae8a/FLAG8c1dfabae [2018-10-26 21:50:50,832 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:50:50,833 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-10-26 21:50:50,845 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/data/a78e24c4d/e46afb622b5e46bbbdf7fe3cff95ae8a/FLAG8c1dfabae [2018-10-26 21:50:50,860 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/data/a78e24c4d/e46afb622b5e46bbbdf7fe3cff95ae8a [2018-10-26 21:50:50,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:50:50,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 21:50:50,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:50:50,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:50:50,869 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:50:50,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:50:50" (1/1) ... [2018-10-26 21:50:50,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@180fa223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:50, skipping insertion in model container [2018-10-26 21:50:50,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:50:50" (1/1) ... [2018-10-26 21:50:50,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:50:50,920 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:50:51,221 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:50:51,231 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:50:51,302 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:50:51,352 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:50:51,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:51 WrapperNode [2018-10-26 21:50:51,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:50:51,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:50:51,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:50:51,353 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:50:51,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:51" (1/1) ... [2018-10-26 21:50:51,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:51" (1/1) ... [2018-10-26 21:50:51,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:50:51,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:50:51,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:50:51,493 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:50:51,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:51" (1/1) ... [2018-10-26 21:50:51,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:51" (1/1) ... [2018-10-26 21:50:51,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:51" (1/1) ... [2018-10-26 21:50:51,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:51" (1/1) ... [2018-10-26 21:50:51,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:51" (1/1) ... [2018-10-26 21:50:51,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:51" (1/1) ... [2018-10-26 21:50:51,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:51" (1/1) ... [2018-10-26 21:50:51,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:50:51,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:50:51,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:50:51,532 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:50:51,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/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-10-26 21:50:51,622 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-10-26 21:50:51,623 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-10-26 21:50:51,623 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:50:51,623 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-10-26 21:50:51,623 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-10-26 21:50:51,623 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-10-26 21:50:51,623 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-10-26 21:50:51,624 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-10-26 21:50:51,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 21:50:51,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 21:50:51,624 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 21:50:51,624 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 21:50:51,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:50:51,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:50:51,625 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-10-26 21:50:51,625 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-10-26 21:50:52,363 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:50:52,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:50:52 BoogieIcfgContainer [2018-10-26 21:50:52,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:50:52,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:50:52,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:50:52,367 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:50:52,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:50:50" (1/3) ... [2018-10-26 21:50:52,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fdd229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:50:52, skipping insertion in model container [2018-10-26 21:50:52,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:50:51" (2/3) ... [2018-10-26 21:50:52,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fdd229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:50:52, skipping insertion in model container [2018-10-26 21:50:52,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:50:52" (3/3) ... [2018-10-26 21:50:52,371 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-10-26 21:50:52,376 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:50:52,382 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:50:52,394 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:50:52,417 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:50:52,417 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:50:52,417 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:50:52,417 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:50:52,417 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:50:52,418 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:50:52,418 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:50:52,418 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:50:52,434 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-10-26 21:50:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 21:50:52,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:52,439 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] [2018-10-26 21:50:52,441 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:52,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:52,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1708855369, now seen corresponding path program 1 times [2018-10-26 21:50:52,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:50:52,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:52,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:52,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:52,493 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:50:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:50:52,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:52,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 21:50:52,598 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:50:52,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 21:50:52,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 21:50:52,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 21:50:52,617 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 2 states. [2018-10-26 21:50:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:52,640 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2018-10-26 21:50:52,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 21:50:52,641 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-10-26 21:50:52,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:52,649 INFO L225 Difference]: With dead ends: 103 [2018-10-26 21:50:52,650 INFO L226 Difference]: Without dead ends: 44 [2018-10-26 21:50:52,653 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-10-26 21:50:52,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-26 21:50:52,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-26 21:50:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-26 21:50:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-10-26 21:50:52,690 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 32 [2018-10-26 21:50:52,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:52,691 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-10-26 21:50:52,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 21:50:52,692 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-10-26 21:50:52,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 21:50:52,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:52,694 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] [2018-10-26 21:50:52,694 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:52,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:52,695 INFO L82 PathProgramCache]: Analyzing trace with hash -918557474, now seen corresponding path program 1 times [2018-10-26 21:50:52,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:50:52,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:52,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:52,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:52,697 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:50:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:50:52,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:52,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:50:52,925 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:50:52,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:50:52,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:50:52,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:52,927 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2018-10-26 21:50:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:53,011 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-10-26 21:50:53,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:50:53,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-26 21:50:53,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:53,014 INFO L225 Difference]: With dead ends: 65 [2018-10-26 21:50:53,015 INFO L226 Difference]: Without dead ends: 50 [2018-10-26 21:50:53,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:50:53,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-26 21:50:53,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-10-26 21:50:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-26 21:50:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2018-10-26 21:50:53,025 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 34 [2018-10-26 21:50:53,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:53,027 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2018-10-26 21:50:53,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:50:53,027 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2018-10-26 21:50:53,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 21:50:53,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:53,028 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] [2018-10-26 21:50:53,028 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:53,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:53,029 INFO L82 PathProgramCache]: Analyzing trace with hash -238499104, now seen corresponding path program 1 times [2018-10-26 21:50:53,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:50:53,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:53,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:53,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:53,030 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:50:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:53,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:50:53,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:53,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:50:53,189 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:50:53,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:50:53,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:50:53,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:50:53,191 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 5 states. [2018-10-26 21:50:53,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:53,325 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2018-10-26 21:50:53,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:50:53,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-10-26 21:50:53,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:53,328 INFO L225 Difference]: With dead ends: 86 [2018-10-26 21:50:53,328 INFO L226 Difference]: Without dead ends: 52 [2018-10-26 21:50:53,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:50:53,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-26 21:50:53,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-10-26 21:50:53,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-26 21:50:53,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2018-10-26 21:50:53,335 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 34 [2018-10-26 21:50:53,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:53,336 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2018-10-26 21:50:53,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:50:53,336 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-10-26 21:50:53,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-26 21:50:53,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:53,337 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:50:53,337 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:53,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:53,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1064843297, now seen corresponding path program 1 times [2018-10-26 21:50:53,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:50:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:53,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:53,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:53,339 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:50:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 21:50:53,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:50:53,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 21:50:53,529 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:50:53,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:50:53,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:50:53,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:50:53,530 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 6 states. [2018-10-26 21:50:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:53,644 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2018-10-26 21:50:53,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:50:53,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-10-26 21:50:53,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:53,646 INFO L225 Difference]: With dead ends: 64 [2018-10-26 21:50:53,646 INFO L226 Difference]: Without dead ends: 48 [2018-10-26 21:50:53,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:50:53,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-26 21:50:53,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-26 21:50:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-26 21:50:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-10-26 21:50:53,652 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 44 [2018-10-26 21:50:53,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:53,653 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-10-26 21:50:53,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:50:53,653 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-10-26 21:50:53,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-26 21:50:53,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:53,654 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:50:53,654 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:53,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:53,655 INFO L82 PathProgramCache]: Analyzing trace with hash -865517767, now seen corresponding path program 1 times [2018-10-26 21:50:53,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:50:53,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:53,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:53,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:53,656 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:50:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 21:50:53,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:50:53,823 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:50:53,823 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-10-26 21:50:53,825 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [28], [30], [32], [34], [38], [39], [43], [45], [49], [53], [55], [61], [65], [66], [67], [69], [71], [75], [81], [84], [121], [124], [130], [132], [133], [134], [135], [136], [137], [138], [140], [141], [142], [143], [144], [145] [2018-10-26 21:50:53,881 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 21:50:53,881 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 21:50:54,343 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 21:50:54,698 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 21:50:54,699 INFO L272 AbstractInterpreter]: Visited 40 different actions 83 times. Merged at 10 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 54 variables. [2018-10-26 21:50:54,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:54,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 21:50:54,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:50:54,753 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/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-10-26 21:50:54,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:54,762 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 21:50:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:54,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:50:54,926 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 21:50:54,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:50:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 21:50:55,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:50:55,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2018-10-26 21:50:55,353 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:50:55,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:50:55,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:50:55,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:50:55,354 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 6 states. [2018-10-26 21:50:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:50:55,655 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2018-10-26 21:50:55,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:50:55,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-10-26 21:50:55,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:50:55,656 INFO L225 Difference]: With dead ends: 89 [2018-10-26 21:50:55,656 INFO L226 Difference]: Without dead ends: 56 [2018-10-26 21:50:55,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:50:55,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-26 21:50:55,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-10-26 21:50:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-26 21:50:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2018-10-26 21:50:55,660 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 46 [2018-10-26 21:50:55,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:50:55,661 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-10-26 21:50:55,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:50:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2018-10-26 21:50:55,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-26 21:50:55,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:50:55,662 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:50:55,662 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:50:55,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:50:55,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1688326906, now seen corresponding path program 2 times [2018-10-26 21:50:55,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:50:55,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:55,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:50:55,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:50:55,666 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:50:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:50:56,208 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-10-26 21:50:56,543 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 21:50:57,391 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2018-10-26 21:50:57,932 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2018-10-26 21:50:58,158 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2018-10-26 21:50:58,362 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2018-10-26 21:50:58,575 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2018-10-26 21:50:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 21:50:58,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:50:58,830 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:50:58,830 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:50:58,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:50:58,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:50:58,830 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/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-10-26 21:50:58,840 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 21:50:58,840 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 21:50:58,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-26 21:50:58,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:50:58,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:50:58,964 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-10-26 21:50:58,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:50:58,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:50:58,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-10-26 21:50:58,987 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-10-26 21:50:58,989 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-10-26 21:50:58,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:50:58,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:50:58,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:50:58,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-10-26 21:50:59,185 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-10-26 21:50:59,187 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-10-26 21:50:59,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:50:59,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:50:59,199 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-10-26 21:50:59,201 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-10-26 21:50:59,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:50:59,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:50:59,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:50:59,210 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-10-26 21:50:59,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 21:50:59,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-10-26 21:50:59,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:50:59,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:50:59,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-26 21:50:59,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:46 [2018-10-26 21:51:00,356 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 60 [2018-10-26 21:51:00,361 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:00,364 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:00,365 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-10-26 21:51:00,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:00,448 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 205 treesize of output 176 [2018-10-26 21:51:00,460 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:00,463 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 162 treesize of output 187 [2018-10-26 21:51:00,463 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:00,880 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 185 treesize of output 184 [2018-10-26 21:51:00,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:01,242 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 3 case distinctions, treesize of input 184 treesize of output 162 [2018-10-26 21:51:01,248 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 166 treesize of output 165 [2018-10-26 21:51:01,248 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:01,509 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:01,512 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 139 treesize of output 162 [2018-10-26 21:51:01,513 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:01,743 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 152 treesize of output 147 [2018-10-26 21:51:01,753 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-10-26 21:51:01,753 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:01,769 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:01,975 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 1 case distinctions, treesize of input 157 treesize of output 155 [2018-10-26 21:51:01,984 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-10-26 21:51:01,985 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:02,002 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:02,099 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:02,350 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 183 treesize of output 159 [2018-10-26 21:51:02,357 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:02,359 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:02,359 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:51:02,365 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 142 treesize of output 185 [2018-10-26 21:51:02,365 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:02,622 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 165 treesize of output 164 [2018-10-26 21:51:02,623 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:02,862 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:02,868 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 162 treesize of output 145 [2018-10-26 21:51:02,873 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:02,874 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:51:02,879 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 128 treesize of output 157 [2018-10-26 21:51:02,879 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:02,899 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:03,096 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 159 treesize of output 154 [2018-10-26 21:51:03,102 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:03,103 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:03,103 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:51:03,112 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 136 treesize of output 161 [2018-10-26 21:51:03,115 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:51:03,158 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:51:03,242 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-26 21:51:03,632 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 156 treesize of output 153 [2018-10-26 21:51:03,637 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:03,642 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 135 treesize of output 149 [2018-10-26 21:51:03,642 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:03,695 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:51:03,846 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-26 21:51:04,142 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-26 21:51:04,289 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 161 treesize of output 127 [2018-10-26 21:51:04,292 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:04,294 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-10-26 21:51:04,295 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:04,329 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-10-26 21:51:04,347 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-10-26 21:51:04,347 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:04,411 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 67 [2018-10-26 21:51:04,414 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:04,416 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 62 [2018-10-26 21:51:04,417 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:04,427 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:04,435 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:04,455 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:04,479 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-10-26 21:51:04,504 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-10-26 21:51:04,504 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:04,844 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:04,845 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-10-26 21:51:04,846 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,038 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-10-26 21:51:05,044 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-10-26 21:51:05,045 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,192 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:05,193 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-10-26 21:51:05,193 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,362 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-10-26 21:51:05,367 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-10-26 21:51:05,367 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,382 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,460 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-10-26 21:51:05,481 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-10-26 21:51:05,481 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,494 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,532 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,624 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 127 treesize of output 101 [2018-10-26 21:51:05,628 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-10-26 21:51:05,628 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,659 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 60 [2018-10-26 21:51:05,663 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:05,666 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 49 treesize of output 53 [2018-10-26 21:51:05,666 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,675 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,688 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,730 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,740 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 154 treesize of output 150 [2018-10-26 21:51:05,744 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-10-26 21:51:05,744 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,774 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 116 treesize of output 70 [2018-10-26 21:51:05,780 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:05,781 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 44 treesize of output 84 [2018-10-26 21:51:05,781 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,801 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 85 treesize of output 88 [2018-10-26 21:51:05,806 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-10-26 21:51:05,806 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,818 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,826 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,841 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,902 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 109 treesize of output 106 [2018-10-26 21:51:05,906 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-10-26 21:51:05,906 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,924 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,929 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 97 treesize of output 94 [2018-10-26 21:51:05,932 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-10-26 21:51:05,932 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,946 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,951 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 118 treesize of output 123 [2018-10-26 21:51:05,954 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-10-26 21:51:05,954 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:05,971 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-26 21:51:06,035 INFO L202 ElimStorePlain]: Needed 54 recursive calls to eliminate 11 variables, input treesize:328, output treesize:185 [2018-10-26 21:51:06,175 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 76 treesize of output 64 [2018-10-26 21:51:06,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-10-26 21:51:06,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,188 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-10-26 21:51:06,188 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,225 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 61 treesize of output 53 [2018-10-26 21:51:06,229 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 39 treesize of output 28 [2018-10-26 21:51:06,229 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,299 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,341 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 42 treesize of output 42 [2018-10-26 21:51:06,344 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 38 treesize of output 29 [2018-10-26 21:51:06,345 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,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 29 treesize of output 22 [2018-10-26 21:51:06,367 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,392 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:06,393 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 34 treesize of output 29 [2018-10-26 21:51:06,393 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,402 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,430 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 72 [2018-10-26 21:51:06,433 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 65 treesize of output 60 [2018-10-26 21:51:06,433 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,461 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 60 treesize of output 46 [2018-10-26 21:51:06,461 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 21:51:06,521 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 59 treesize of output 42 [2018-10-26 21:51:06,522 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,543 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-26 21:51:06,576 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 40 treesize of output 40 [2018-10-26 21:51:06,600 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 36 treesize of output 31 [2018-10-26 21:51:06,600 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,697 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-10-26 21:51:06,697 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,714 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 32 treesize of output 21 [2018-10-26 21:51:06,714 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,725 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:51:06,747 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 46 treesize of output 38 [2018-10-26 21:51:06,749 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:06,750 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 20 treesize of output 15 [2018-10-26 21:51:06,750 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,756 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-26 21:51:06,773 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 10 variables, input treesize:223, output treesize:55 [2018-10-26 21:51:06,856 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 24 [2018-10-26 21:51:06,858 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 20 treesize of output 16 [2018-10-26 21:51:06,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,866 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-10-26 21:51:06,867 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-10-26 21:51:06,873 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:51:06,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:06,882 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:1 [2018-10-26 21:51:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 21:51:06,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:51:07,484 WARN L179 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2018-10-26 21:51:07,666 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-10-26 21:51:07,774 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 27 treesize of output 24 [2018-10-26 21:51:07,781 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 24 treesize of output 23 [2018-10-26 21:51:07,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:07,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:07,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-10-26 21:51:07,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:321, output treesize:294 [2018-10-26 21:51:31,454 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_main_~data~0_BEFORE_CALL_2 Int) (|v_sll_insert_write~$Pointer$_#value.base_14| Int) (|v_sll_insert_write~$Pointer$_#value.base_15| Int) (|v_sll_insert_write~$Pointer$_#value.offset_12| Int)) (or (= (let ((.cse1 (+ c_sll_insert_~new_node~0.offset 4)) (.cse2 (+ c_sll_insert_~snd_to_last~0.offset 4))) (select (select |c_#memory_int| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_sll_insert_~snd_to_last~0.base (store (select |c_#memory_$Pointer$.base| c_sll_insert_~snd_to_last~0.base) .cse2 |v_sll_insert_write~$Pointer$_#value.base_15|)))) (store .cse0 c_sll_insert_~new_node~0.base (store (select .cse0 c_sll_insert_~new_node~0.base) .cse1 |v_sll_insert_write~$Pointer$_#value.base_14|))) |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| c_sll_insert_~snd_to_last~0.base (store (select |c_#memory_$Pointer$.offset| c_sll_insert_~snd_to_last~0.base) .cse2 c_sll_insert_~new_node~0.offset)))) (store .cse3 c_sll_insert_~new_node~0.base (store (select .cse3 c_sll_insert_~new_node~0.base) .cse1 |v_sll_insert_write~$Pointer$_#value.offset_12|))) |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) v_main_~data~0_BEFORE_CALL_2) (exists ((|v_sll_insert_write~$Pointer$_#value.base_12| Int) (|v_sll_insert_write~$Pointer$_#value.base_13| Int) (|v_node_create_write~int_#value_19| Int) (|v_sll_insert_write~$Pointer$_#ptr.base_11| Int) (|v_sll_insert_write~$Pointer$_#value.offset_11| Int) (|v_node_create_write~$Pointer$_#value.base_19| Int) (|v_node_create_write~$Pointer$_#value.offset_19| Int)) (and (= 0 (select |c_old(#valid)| |v_sll_insert_write~$Pointer$_#ptr.base_11|)) (not (= (let ((.cse9 (store |c_old(#memory_$Pointer$.offset)| |v_sll_insert_write~$Pointer$_#ptr.base_11| (store (select |c_old(#memory_$Pointer$.offset)| |v_sll_insert_write~$Pointer$_#ptr.base_11|) 4 |v_node_create_write~$Pointer$_#value.offset_19|))) (.cse5 (store |c_old(#memory_$Pointer$.base)| |v_sll_insert_write~$Pointer$_#ptr.base_11| (store (select |c_old(#memory_$Pointer$.base)| |v_sll_insert_write~$Pointer$_#ptr.base_11|) 4 |v_node_create_write~$Pointer$_#value.base_19|)))) (let ((.cse6 (select (select .cse5 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)) (.cse7 (+ (select (select .cse9 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|) 4))) (select (select (store |c_old(#memory_int)| |v_sll_insert_write~$Pointer$_#ptr.base_11| (store (select |c_old(#memory_int)| |v_sll_insert_write~$Pointer$_#ptr.base_11|) 0 |v_node_create_write~int_#value_19|)) (select (select (let ((.cse4 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 |v_sll_insert_write~$Pointer$_#value.base_13|)))) (store .cse4 |v_sll_insert_write~$Pointer$_#ptr.base_11| (store (select .cse4 |v_sll_insert_write~$Pointer$_#ptr.base_11|) 4 |v_sll_insert_write~$Pointer$_#value.base_12|))) |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)) (select (select (let ((.cse8 (store .cse9 .cse6 (store (select .cse9 .cse6) .cse7 0)))) (store .cse8 |v_sll_insert_write~$Pointer$_#ptr.base_11| (store (select .cse8 |v_sll_insert_write~$Pointer$_#ptr.base_11|) 4 |v_sll_insert_write~$Pointer$_#value.offset_11|))) |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)))) v_main_~data~0_BEFORE_CALL_2)))))) is different from false [2018-10-26 21:51:33,472 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_main_~data~0_BEFORE_CALL_2 Int) (|v_sll_insert_write~$Pointer$_#value.base_14| Int) (|v_sll_insert_write~$Pointer$_#value.base_15| Int) (|v_sll_insert_write~$Pointer$_#value.offset_12| Int)) (or (exists ((|v_sll_insert_write~$Pointer$_#value.base_12| Int) (|v_sll_insert_write~$Pointer$_#value.base_13| Int) (|v_node_create_write~int_#value_19| Int) (|v_sll_insert_write~$Pointer$_#ptr.base_11| Int) (|v_sll_insert_write~$Pointer$_#value.offset_11| Int) (|v_node_create_write~$Pointer$_#value.base_19| Int) (|v_node_create_write~$Pointer$_#value.offset_19| Int)) (and (= 0 (select |c_old(#valid)| |v_sll_insert_write~$Pointer$_#ptr.base_11|)) (not (= (let ((.cse5 (store |c_old(#memory_$Pointer$.offset)| |v_sll_insert_write~$Pointer$_#ptr.base_11| (store (select |c_old(#memory_$Pointer$.offset)| |v_sll_insert_write~$Pointer$_#ptr.base_11|) 4 |v_node_create_write~$Pointer$_#value.offset_19|))) (.cse1 (store |c_old(#memory_$Pointer$.base)| |v_sll_insert_write~$Pointer$_#ptr.base_11| (store (select |c_old(#memory_$Pointer$.base)| |v_sll_insert_write~$Pointer$_#ptr.base_11|) 4 |v_node_create_write~$Pointer$_#value.base_19|)))) (let ((.cse2 (select (select .cse1 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)) (.cse3 (+ (select (select .cse5 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|) 4))) (select (select (store |c_old(#memory_int)| |v_sll_insert_write~$Pointer$_#ptr.base_11| (store (select |c_old(#memory_int)| |v_sll_insert_write~$Pointer$_#ptr.base_11|) 0 |v_node_create_write~int_#value_19|)) (select (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |v_sll_insert_write~$Pointer$_#value.base_13|)))) (store .cse0 |v_sll_insert_write~$Pointer$_#ptr.base_11| (store (select .cse0 |v_sll_insert_write~$Pointer$_#ptr.base_11|) 4 |v_sll_insert_write~$Pointer$_#value.base_12|))) |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)) (select (select (let ((.cse4 (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 0)))) (store .cse4 |v_sll_insert_write~$Pointer$_#ptr.base_11| (store (select .cse4 |v_sll_insert_write~$Pointer$_#ptr.base_11|) 4 |v_sll_insert_write~$Pointer$_#value.offset_11|))) |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)))) v_main_~data~0_BEFORE_CALL_2)))) (= (let ((.cse7 (+ c_sll_insert_~new_node~0.offset 4)) (.cse8 (+ c_sll_insert_~last~0.offset 4))) (select (select |c_#memory_int| (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| c_sll_insert_~last~0.base (store (select |c_#memory_$Pointer$.base| c_sll_insert_~last~0.base) .cse8 |v_sll_insert_write~$Pointer$_#value.base_15|)))) (store .cse6 c_sll_insert_~new_node~0.base (store (select .cse6 c_sll_insert_~new_node~0.base) .cse7 |v_sll_insert_write~$Pointer$_#value.base_14|))) |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)) (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| c_sll_insert_~last~0.base (store (select |c_#memory_$Pointer$.offset| c_sll_insert_~last~0.base) .cse8 c_sll_insert_~new_node~0.offset)))) (store .cse9 c_sll_insert_~new_node~0.base (store (select .cse9 c_sll_insert_~new_node~0.base) .cse7 |v_sll_insert_write~$Pointer$_#value.offset_12|))) |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) v_main_~data~0_BEFORE_CALL_2))) is different from false [2018-10-26 21:51:35,509 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_main_~data~0_BEFORE_CALL_2 Int) (|v_sll_insert_write~$Pointer$_#value.base_14| Int) (|v_sll_insert_write~$Pointer$_#value.base_15| Int) (|v_sll_insert_write~$Pointer$_#value.offset_12| Int)) (or (= (let ((.cse1 (+ |c_sll_insert_#t~ret6.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| c_sll_insert_~head.base) c_sll_insert_~head.offset)) (.cse3 (+ (select (select |c_#memory_$Pointer$.offset| c_sll_insert_~head.base) c_sll_insert_~head.offset) 4))) (select (select |c_#memory_int| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse3 |v_sll_insert_write~$Pointer$_#value.base_15|)))) (store .cse0 |c_sll_insert_#t~ret6.base| (store (select .cse0 |c_sll_insert_#t~ret6.base|) .cse1 |v_sll_insert_write~$Pointer$_#value.base_14|))) |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 |c_sll_insert_#t~ret6.offset|)))) (store .cse4 |c_sll_insert_#t~ret6.base| (store (select .cse4 |c_sll_insert_#t~ret6.base|) .cse1 |v_sll_insert_write~$Pointer$_#value.offset_12|))) |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) v_main_~data~0_BEFORE_CALL_2) (exists ((|v_sll_insert_write~$Pointer$_#value.base_12| Int) (|v_sll_insert_write~$Pointer$_#value.base_13| Int) (|v_node_create_write~int_#value_19| Int) (|v_sll_insert_write~$Pointer$_#ptr.base_11| Int) (|v_sll_insert_write~$Pointer$_#value.offset_11| Int) (|v_node_create_write~$Pointer$_#value.base_19| Int) (|v_node_create_write~$Pointer$_#value.offset_19| Int)) (and (= 0 (select |c_old(#valid)| |v_sll_insert_write~$Pointer$_#ptr.base_11|)) (not (= (let ((.cse10 (store |c_old(#memory_$Pointer$.offset)| |v_sll_insert_write~$Pointer$_#ptr.base_11| (store (select |c_old(#memory_$Pointer$.offset)| |v_sll_insert_write~$Pointer$_#ptr.base_11|) 4 |v_node_create_write~$Pointer$_#value.offset_19|))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_sll_insert_write~$Pointer$_#ptr.base_11| (store (select |c_old(#memory_$Pointer$.base)| |v_sll_insert_write~$Pointer$_#ptr.base_11|) 4 |v_node_create_write~$Pointer$_#value.base_19|)))) (let ((.cse7 (select (select .cse6 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)) (.cse8 (+ (select (select .cse10 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|) 4))) (select (select (store |c_old(#memory_int)| |v_sll_insert_write~$Pointer$_#ptr.base_11| (store (select |c_old(#memory_int)| |v_sll_insert_write~$Pointer$_#ptr.base_11|) 0 |v_node_create_write~int_#value_19|)) (select (select (let ((.cse5 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |v_sll_insert_write~$Pointer$_#value.base_13|)))) (store .cse5 |v_sll_insert_write~$Pointer$_#ptr.base_11| (store (select .cse5 |v_sll_insert_write~$Pointer$_#ptr.base_11|) 4 |v_sll_insert_write~$Pointer$_#value.base_12|))) |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)) (select (select (let ((.cse9 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 0)))) (store .cse9 |v_sll_insert_write~$Pointer$_#ptr.base_11| (store (select .cse9 |v_sll_insert_write~$Pointer$_#ptr.base_11|) 4 |v_sll_insert_write~$Pointer$_#value.offset_11|))) |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)))) v_main_~data~0_BEFORE_CALL_2)))))) is different from false [2018-10-26 21:51:35,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 27 treesize of output 24 [2018-10-26 21:51:35,816 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 24 treesize of output 23 [2018-10-26 21:51:35,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:35,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:36,145 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:51:36,146 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-26 21:51:36,149 INFO L168 Benchmark]: Toolchain (without parser) took 45285.60 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 322.4 MB). Free memory was 951.8 MB in the beginning and 1.3 GB in the end (delta: -359.0 MB). Peak memory consumption was 354.8 MB. Max. memory is 11.5 GB. [2018-10-26 21:51:36,149 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:51:36,149 INFO L168 Benchmark]: CACSL2BoogieTranslator took 487.82 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 927.6 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-26 21:51:36,150 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 927.6 MB in the beginning and 1.2 GB in the end (delta: -223.1 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2018-10-26 21:51:36,150 INFO L168 Benchmark]: Boogie Preprocessor took 37.96 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 21:51:36,150 INFO L168 Benchmark]: RCFGBuilder took 832.43 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: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2018-10-26 21:51:36,150 INFO L168 Benchmark]: TraceAbstraction took 43783.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -199.9 MB). Peak memory consumption was 362.4 MB. Max. memory is 11.5 GB. [2018-10-26 21:51:36,163 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 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 487.82 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 927.6 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 139.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 927.6 MB in the beginning and 1.2 GB in the end (delta: -223.1 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.96 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 832.43 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: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 43783.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -199.9 MB). Peak memory consumption was 362.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) 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-10-26 21:51:37,921 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:51:37,922 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:51:37,932 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:51:37,932 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:51:37,933 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:51:37,934 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:51:37,935 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:51:37,937 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:51:37,937 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:51:37,938 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:51:37,938 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:51:37,939 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:51:37,940 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:51:37,941 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:51:37,941 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:51:37,942 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:51:37,944 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:51:37,945 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:51:37,946 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:51:37,948 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:51:37,948 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:51:37,950 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:51:37,951 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:51:37,951 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:51:37,952 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:51:37,952 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:51:37,953 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:51:37,953 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:51:37,954 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:51:37,954 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:51:37,955 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:51:37,956 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:51:37,956 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:51:37,957 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:51:37,957 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:51:37,958 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 21:51:37,969 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:51:37,970 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:51:37,970 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:51:37,970 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 21:51:37,971 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 21:51:37,971 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 21:51:37,971 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 21:51:37,972 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 21:51:37,972 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:51:37,972 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:51:37,973 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:51:37,973 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:51:37,973 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:51:37,973 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:51:37,973 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:51:37,973 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 21:51:37,973 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 21:51:37,973 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:51:37,974 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:51:37,974 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:51:37,974 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:51:37,974 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:51:37,974 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:51:37,974 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:51:37,974 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:51:37,975 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:51:37,975 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:51:37,975 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:51:37,977 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 21:51:37,977 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:51:37,977 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 21:51:37,977 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 21:51:37,978 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_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan 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 -> Taipan 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 -> 6054e98f999cfedecdcceeeadabf7a119475d890 [2018-10-26 21:51:38,010 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:51:38,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:51:38,025 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:51:38,026 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:51:38,026 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:51:38,027 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-10-26 21:51:38,066 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/data/33bf50cc3/018ec6e9c06f4ff69b0bf5657704af72/FLAG4efb5a11e [2018-10-26 21:51:38,572 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:51:38,572 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/sv-benchmarks/c/list-simple/sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-10-26 21:51:38,589 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/data/33bf50cc3/018ec6e9c06f4ff69b0bf5657704af72/FLAG4efb5a11e [2018-10-26 21:51:38,603 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/data/33bf50cc3/018ec6e9c06f4ff69b0bf5657704af72 [2018-10-26 21:51:38,608 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:51:38,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 21:51:38,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:51:38,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:51:38,617 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:51:38,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:51:38" (1/1) ... [2018-10-26 21:51:38,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1439afcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:51:38, skipping insertion in model container [2018-10-26 21:51:38,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:51:38" (1/1) ... [2018-10-26 21:51:38,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:51:38,675 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:51:38,943 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:51:38,958 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:51:39,006 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:51:39,048 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:51:39,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:51:39 WrapperNode [2018-10-26 21:51:39,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:51:39,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:51:39,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:51:39,050 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:51:39,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:51:39" (1/1) ... [2018-10-26 21:51:39,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:51:39" (1/1) ... [2018-10-26 21:51:39,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:51:39,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:51:39,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:51:39,114 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:51:39,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:51:39" (1/1) ... [2018-10-26 21:51:39,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:51:39" (1/1) ... [2018-10-26 21:51:39,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:51:39" (1/1) ... [2018-10-26 21:51:39,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:51:39" (1/1) ... [2018-10-26 21:51:39,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:51:39" (1/1) ... [2018-10-26 21:51:39,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:51:39" (1/1) ... [2018-10-26 21:51:39,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:51:39" (1/1) ... [2018-10-26 21:51:39,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:51:39,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:51:39,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:51:39,244 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:51:39,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:51:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/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-10-26 21:51:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-10-26 21:51:39,321 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-10-26 21:51:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:51:39,321 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-10-26 21:51:39,322 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-10-26 21:51:39,322 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-10-26 21:51:39,322 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-10-26 21:51:39,322 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-10-26 21:51:39,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 21:51:39,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 21:51:39,322 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 21:51:39,323 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 21:51:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:51:39,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:51:39,326 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-10-26 21:51:39,326 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-10-26 21:51:39,972 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:51:39,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:51:39 BoogieIcfgContainer [2018-10-26 21:51:39,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:51:39,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:51:39,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:51:39,977 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:51:39,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:51:38" (1/3) ... [2018-10-26 21:51:39,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3706ba7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:51:39, skipping insertion in model container [2018-10-26 21:51:39,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:51:39" (2/3) ... [2018-10-26 21:51:39,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3706ba7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:51:39, skipping insertion in model container [2018-10-26 21:51:39,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:51:39" (3/3) ... [2018-10-26 21:51:39,981 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal_true-unreach-call_true-valid-memsafety.i [2018-10-26 21:51:39,990 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:51:39,997 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:51:40,010 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:51:40,035 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:51:40,036 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:51:40,036 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:51:40,036 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:51:40,036 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:51:40,036 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:51:40,036 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:51:40,036 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:51:40,036 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:51:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-10-26 21:51:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 21:51:40,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:51:40,059 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] [2018-10-26 21:51:40,061 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:51:40,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:51:40,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1708855369, now seen corresponding path program 1 times [2018-10-26 21:51:40,072 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:51:40,072 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/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-10-26 21:51:40,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:51:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:51:40,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:51:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:51:40,244 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:51:40,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:51:40,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 21:51:40,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 21:51:40,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 21:51:40,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 21:51:40,266 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 2 states. [2018-10-26 21:51:40,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:51:40,288 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2018-10-26 21:51:40,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 21:51:40,290 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-10-26 21:51:40,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:51:40,297 INFO L225 Difference]: With dead ends: 103 [2018-10-26 21:51:40,297 INFO L226 Difference]: Without dead ends: 44 [2018-10-26 21:51:40,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 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-10-26 21:51:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-26 21:51:40,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-26 21:51:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-26 21:51:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-10-26 21:51:40,338 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 32 [2018-10-26 21:51:40,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:51:40,338 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-10-26 21:51:40,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 21:51:40,339 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-10-26 21:51:40,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 21:51:40,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:51:40,341 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] [2018-10-26 21:51:40,341 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:51:40,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:51:40,341 INFO L82 PathProgramCache]: Analyzing trace with hash -918557474, now seen corresponding path program 1 times [2018-10-26 21:51:40,342 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:51:40,342 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/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-10-26 21:51:40,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:51:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:51:40,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:51:40,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:51:40,551 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:51:40,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:51:40,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:51:40,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:51:40,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:51:40,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:51:40,554 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2018-10-26 21:51:40,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:51:40,593 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-10-26 21:51:40,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:51:40,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-26 21:51:40,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:51:40,597 INFO L225 Difference]: With dead ends: 65 [2018-10-26 21:51:40,597 INFO L226 Difference]: Without dead ends: 50 [2018-10-26 21:51:40,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-10-26 21:51:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-26 21:51:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-10-26 21:51:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-26 21:51:40,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2018-10-26 21:51:40,608 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 34 [2018-10-26 21:51:40,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:51:40,611 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2018-10-26 21:51:40,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:51:40,611 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2018-10-26 21:51:40,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 21:51:40,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:51:40,614 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] [2018-10-26 21:51:40,615 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:51:40,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:51:40,615 INFO L82 PathProgramCache]: Analyzing trace with hash -238499104, now seen corresponding path program 1 times [2018-10-26 21:51:40,616 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:51:40,616 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/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-10-26 21:51:40,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:51:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:51:40,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:51:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:51:40,850 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:51:40,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:51:40,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:51:40,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:51:40,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:51:40,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:51:40,860 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 5 states. [2018-10-26 21:51:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:51:41,156 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2018-10-26 21:51:41,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:51:41,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-10-26 21:51:41,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:51:41,158 INFO L225 Difference]: With dead ends: 86 [2018-10-26 21:51:41,159 INFO L226 Difference]: Without dead ends: 52 [2018-10-26 21:51:41,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:51:41,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-26 21:51:41,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-10-26 21:51:41,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-26 21:51:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2018-10-26 21:51:41,167 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 34 [2018-10-26 21:51:41,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:51:41,171 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2018-10-26 21:51:41,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:51:41,172 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-10-26 21:51:41,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-26 21:51:41,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:51:41,173 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:51:41,173 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:51:41,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:51:41,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1064843297, now seen corresponding path program 1 times [2018-10-26 21:51:41,174 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:51:41,174 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/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-10-26 21:51:41,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:51:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:51:41,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:51:41,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:51:41,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:51:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 21:51:41,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:51:41,857 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:51:41,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:51:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:51:41,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:51:42,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:51:42,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:51:42,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 21:51:42,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 21:51:42,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7, 7] total 16 [2018-10-26 21:51:42,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 21:51:42,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 21:51:42,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-10-26 21:51:42,538 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 16 states. [2018-10-26 21:51:42,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:51:42,822 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2018-10-26 21:51:42,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 21:51:42,824 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-10-26 21:51:42,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:51:42,824 INFO L225 Difference]: With dead ends: 91 [2018-10-26 21:51:42,825 INFO L226 Difference]: Without dead ends: 57 [2018-10-26 21:51:42,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-10-26 21:51:42,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-26 21:51:42,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-10-26 21:51:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-26 21:51:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-10-26 21:51:42,834 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 44 [2018-10-26 21:51:42,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:51:42,834 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-10-26 21:51:42,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 21:51:42,834 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-10-26 21:51:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-26 21:51:42,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:51:42,837 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:51:42,837 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:51:42,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:51:42,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1399535582, now seen corresponding path program 2 times [2018-10-26 21:51:42,838 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:51:42,838 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/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-10-26 21:51:42,862 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-10-26 21:51:42,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-26 21:51:42,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:51:42,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:51:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 21:51:43,071 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 21:51:43,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:51:43,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 21:51:43,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:51:43,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:51:43,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:51:43,074 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 6 states. [2018-10-26 21:51:43,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:51:43,157 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2018-10-26 21:51:43,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:51:43,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-10-26 21:51:43,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:51:43,159 INFO L225 Difference]: With dead ends: 69 [2018-10-26 21:51:43,159 INFO L226 Difference]: Without dead ends: 53 [2018-10-26 21:51:43,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:51:43,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-26 21:51:43,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-26 21:51:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-26 21:51:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2018-10-26 21:51:43,167 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 54 [2018-10-26 21:51:43,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:51:43,168 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-10-26 21:51:43,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:51:43,168 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2018-10-26 21:51:43,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-26 21:51:43,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:51:43,169 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:51:43,170 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:51:43,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:51:43,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1688326906, now seen corresponding path program 1 times [2018-10-26 21:51:43,170 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 21:51:43,171 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 21:51:43,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 21:51:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:51:43,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:51:43,582 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-10-26 21:51:43,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:43,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:43,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-10-26 21:51:43,645 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_write~intINTTYPE4_#ptr.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |node_create_write~intINTTYPE4_#ptr.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_write~intINTTYPE4_#ptr.base| (_ bv1 1))))) is different from true [2018-10-26 21:51:43,721 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-10-26 21:51:43,724 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-10-26 21:51:43,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:43,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:43,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:43,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-26 21:51:43,981 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 21:51:44,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 21:51:44,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-10-26 21:51:44,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:44,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:44,205 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-10-26 21:51:44,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:33 [2018-10-26 21:51:44,463 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:44,464 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:44,465 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:44,467 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 25 treesize of output 40 [2018-10-26 21:51:44,486 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 28 treesize of output 34 [2018-10-26 21:51:44,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:44,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:44,682 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-10-26 21:51:44,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:47 [2018-10-26 21:51:44,774 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-10-26 21:51:44,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 8 treesize of output 7 [2018-10-26 21:51:44,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:44,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:44,820 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-10-26 21:51:44,823 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-10-26 21:51:44,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:44,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:44,874 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-10-26 21:51:44,874 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:70, output treesize:71 [2018-10-26 21:51:45,898 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|node_create_write~intINTTYPE4_#value| (_ BitVec 32)) (|sll_insert_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|node_create_write~intINTTYPE4_#ptr.offset| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.base| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.offset| (_ BitVec 32)) (sll_insert_~new_node~0.base (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (|sll_insert_write~$Pointer$_#value.offset| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (|sll_insert_write~$Pointer$_#value.base| (_ BitVec 32))) (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) |node_create_write~$Pointer$_#ptr.offset| |node_create_write~$Pointer$_#value.base|)))) (let ((.cse2 (select (select .cse4 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) (and (= (let ((.cse0 (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) |node_create_write~$Pointer$_#ptr.offset| |node_create_write~$Pointer$_#value.offset|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_prenex_1 v_prenex_2))))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) |sll_insert_write~$Pointer$_#ptr.offset| |sll_insert_write~$Pointer$_#value.offset|))) |c_#memory_$Pointer$.offset|) (= (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_write~intINTTYPE4_#ptr.offset| |node_create_write~intINTTYPE4_#value|)) |c_#memory_int|) (= (let ((.cse3 (store .cse4 .cse2 (store (select .cse4 .cse2) v_prenex_1 v_prenex_3)))) (store .cse3 sll_insert_~new_node~0.base (store (select .cse3 sll_insert_~new_node~0.base) |sll_insert_write~$Pointer$_#ptr.offset| |sll_insert_write~$Pointer$_#value.base|))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base)))))) is different from true [2018-10-26 21:51:48,875 WARN L179 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 103 DAG size of output: 79 [2018-10-26 21:51:48,966 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:49,001 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:49,060 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:51:49,060 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:51:49,061 INFO L303 Elim1Store]: Index analysis took 183 ms [2018-10-26 21:51:49,062 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 28 treesize of output 37 [2018-10-26 21:51:49,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:50,058 INFO L303 Elim1Store]: Index analysis took 218 ms [2018-10-26 21:51:50,059 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-10-26 21:51:50,090 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-10-26 21:51:50,091 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:50,246 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:50,957 INFO L303 Elim1Store]: Index analysis took 167 ms [2018-10-26 21:51:50,958 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 186 treesize of output 166 [2018-10-26 21:51:50,985 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-10-26 21:51:50,986 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:51,409 INFO L303 Elim1Store]: Index analysis took 177 ms [2018-10-26 21:51:51,410 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 161 treesize of output 148 [2018-10-26 21:51:51,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 21:51:51,434 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:51,761 INFO L303 Elim1Store]: Index analysis took 122 ms [2018-10-26 21:51:51,762 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 140 treesize of output 142 [2018-10-26 21:51:51,812 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 14 treesize of output 19 [2018-10-26 21:51:51,812 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-10-26 21:51:51,999 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:51:52,292 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:51:52,564 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:51:53,163 INFO L303 Elim1Store]: Index analysis took 117 ms [2018-10-26 21:51:53,164 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 139 treesize of output 119 [2018-10-26 21:51:53,180 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-10-26 21:51:53,180 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:53,310 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 58 treesize of output 58 [2018-10-26 21:51:53,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 21:51:53,324 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:53,390 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 37 treesize of output 52 [2018-10-26 21:51:53,404 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 11 [2018-10-26 21:51:53,405 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:53,429 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:53,446 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:53,492 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:53,565 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 143 treesize of output 123 [2018-10-26 21:51:53,580 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-10-26 21:51:53,580 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:53,717 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 58 treesize of output 58 [2018-10-26 21:51:53,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 21:51:53,728 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:53,793 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 37 treesize of output 52 [2018-10-26 21:51:53,843 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 14 treesize of output 19 [2018-10-26 21:51:53,843 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-10-26 21:51:53,899 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:51:53,966 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:51:54,060 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:51:54,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:54,239 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 17 variables, input treesize:299, output treesize:35 [2018-10-26 21:51:54,365 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-10-26 21:51:54,371 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-10-26 21:51:54,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:54,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:54,385 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 27 treesize of output 21 [2018-10-26 21:51:54,387 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 21 treesize of output 12 [2018-10-26 21:51:54,388 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:54,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:54,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:54,400 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:16 [2018-10-26 21:51:54,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 21:51:54,497 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-10-26 21:51:54,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:51:54,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:54,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:51:54,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-10-26 21:51:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2018-10-26 21:51:54,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:51:54,991 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-10-26 21:51:55,133 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-10-26 21:51:55,353 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-10-26 21:51:55,531 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-10-26 21:51:57,518 WARN L179 SmtUtils]: Spent 1.98 s on a formula simplification that was a NOOP. DAG size: 117 [2018-10-26 21:51:58,378 WARN L179 SmtUtils]: Spent 856.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-10-26 21:52:00,499 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 83 [2018-10-26 21:52:01,353 WARN L179 SmtUtils]: Spent 853.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-10-26 21:52:23,459 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 55 [2018-10-26 21:52:23,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:52:23,463 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:52:23,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:52:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:52:23,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:52:25,424 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-10-26 21:52:25,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:52:25,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:52:25,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-10-26 21:52:25,645 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-10-26 21:52:25,668 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-10-26 21:52:25,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:52:25,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:52:25,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:52:25,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-10-26 21:52:26,403 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-10-26 21:52:26,406 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-10-26 21:52:26,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:52:26,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:52:26,443 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-10-26 21:52:26,446 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-10-26 21:52:26,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:52:26,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:52:26,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:52:26,462 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2018-10-26 21:52:31,183 WARN L179 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-26 21:52:31,251 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_write~intINTTYPE4_#value| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.base| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.offset| (_ BitVec 32)) (sll_insert_~new_node~0.base (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (|sll_insert_write~$Pointer$_#value.offset| (_ BitVec 32)) (|sll_insert_write~$Pointer$_#value.base| (_ BitVec 32))) (let ((.cse5 (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) |node_create_write~$Pointer$_#value.offset|))) (.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) |node_create_write~$Pointer$_#value.base|)))) (let ((.cse2 (select (select .cse1 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)) (.cse3 (bvadd (select (select .cse5 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|) (_ bv4 32)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_5)))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) (_ bv4 32) |sll_insert_write~$Pointer$_#value.base|)))) (= (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_write~intINTTYPE4_#value|)) |c_#memory_int|) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base)) (= (let ((.cse4 (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_prenex_4)))) (store .cse4 sll_insert_~new_node~0.base (store (select .cse4 sll_insert_~new_node~0.base) (_ bv4 32) |sll_insert_write~$Pointer$_#value.offset|))) |c_#memory_$Pointer$.offset|))))) is different from true [2018-10-26 21:52:36,410 WARN L179 SmtUtils]: Spent 5.15 s on a formula simplification. DAG size of input: 125 DAG size of output: 62 [2018-10-26 21:52:36,527 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:52:36,559 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:52:36,560 INFO L303 Elim1Store]: Index analysis took 149 ms [2018-10-26 21:52:36,561 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-10-26 21:52:36,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 21:52:37,373 INFO L303 Elim1Store]: Index analysis took 392 ms [2018-10-26 21:52:37,522 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 182 treesize of output 165 [2018-10-26 21:52:37,562 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 162 treesize of output 161 [2018-10-26 21:52:37,563 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 21:52:53,185 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:52:53,227 INFO L303 Elim1Store]: Index analysis took 103 ms [2018-10-26 21:52:53,228 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 151 treesize of output 164 [2018-10-26 21:52:53,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:53:14,705 INFO L303 Elim1Store]: Index analysis took 512 ms [2018-10-26 21:53:14,887 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 160 treesize of output 157 [2018-10-26 21:53:14,906 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 150 treesize of output 149 [2018-10-26 21:53:14,907 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:53:19,795 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:53:19,815 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:53:19,815 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:53:19,924 INFO L303 Elim1Store]: Index analysis took 178 ms [2018-10-26 21:53:19,925 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 131 treesize of output 154 [2018-10-26 21:53:19,926 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 21:53:28,014 INFO L303 Elim1Store]: Index analysis took 267 ms [2018-10-26 21:53:28,148 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 136 treesize of output 144 [2018-10-26 21:53:28,173 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:53:28,184 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:53:28,184 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:53:28,294 INFO L303 Elim1Store]: Index analysis took 143 ms [2018-10-26 21:53:28,294 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 129 treesize of output 147 [2018-10-26 21:53:28,295 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 21:53:28,920 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:53:34,742 INFO L303 Elim1Store]: Index analysis took 121 ms [2018-10-26 21:53:34,743 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 131 treesize of output 128 [2018-10-26 21:53:34,767 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:53:34,836 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 102 treesize of output 106 [2018-10-26 21:53:34,837 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-26 21:53:34,975 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:53:37,766 INFO L303 Elim1Store]: Index analysis took 336 ms [2018-10-26 21:53:37,893 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 133 treesize of output 143 [2018-10-26 21:53:37,949 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:53:38,010 INFO L303 Elim1Store]: Index analysis took 115 ms [2018-10-26 21:53:38,011 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 128 treesize of output 134 [2018-10-26 21:53:38,011 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-26 21:53:38,510 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:53:39,199 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:53:46,580 INFO L303 Elim1Store]: Index analysis took 505 ms [2018-10-26 21:53:46,732 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 157 treesize of output 156 [2018-10-26 21:53:46,764 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:53:46,800 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 138 treesize of output 178 [2018-10-26 21:53:46,800 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-26 21:53:52,361 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 139 treesize of output 138 [2018-10-26 21:53:52,361 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-26 21:53:56,305 INFO L303 Elim1Store]: Index analysis took 230 ms [2018-10-26 21:53:56,427 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 138 treesize of output 150 [2018-10-26 21:53:56,464 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 145 treesize of output 139 [2018-10-26 21:53:56,465 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-26 21:53:57,478 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:53:57,531 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 120 treesize of output 126 [2018-10-26 21:53:57,532 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-26 21:53:57,975 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:54:01,115 INFO L303 Elim1Store]: Index analysis took 271 ms [2018-10-26 21:54:01,231 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 133 treesize of output 143 [2018-10-26 21:54:01,295 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:54:01,311 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:54:01,312 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 21:54:01,434 INFO L303 Elim1Store]: Index analysis took 200 ms [2018-10-26 21:54:01,435 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 129 treesize of output 167 [2018-10-26 21:54:01,436 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:02,442 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 128 treesize of output 122 [2018-10-26 21:54:02,442 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:03,003 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:54:05,113 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:54:06,186 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 21:54:07,589 INFO L303 Elim1Store]: Index analysis took 113 ms [2018-10-26 21:54:07,590 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 23 treesize of output 28 [2018-10-26 21:54:07,606 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-10-26 21:54:07,607 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:07,691 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:54:08,622 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:54:08,664 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 139 treesize of output 119 [2018-10-26 21:54:08,670 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-10-26 21:54:08,671 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:08,805 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 0 case distinctions, treesize of input 92 treesize of output 62 [2018-10-26 21:54:08,811 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:54:08,815 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 44 treesize of output 61 [2018-10-26 21:54:08,815 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:08,862 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 61 treesize of output 60 [2018-10-26 21:54:08,869 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-10-26 21:54:08,870 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:08,892 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:54:08,912 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:54:08,944 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:54:09,088 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 117 [2018-10-26 21:54:09,113 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-10-26 21:54:09,113 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:11,437 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:54:11,445 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 103 treesize of output 120 [2018-10-26 21:54:11,445 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:13,380 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 0 case distinctions, treesize of input 116 treesize of output 93 [2018-10-26 21:54:13,387 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-10-26 21:54:13,387 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:13,509 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 72 treesize of output 62 [2018-10-26 21:54:13,516 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:54:13,526 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 59 treesize of output 65 [2018-10-26 21:54:13,526 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:13,549 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:54:13,582 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:54:14,353 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 113 treesize of output 99 [2018-10-26 21:54:14,361 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 95 treesize of output 94 [2018-10-26 21:54:14,361 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:14,825 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:54:14,829 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 82 treesize of output 99 [2018-10-26 21:54:14,829 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:15,331 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:54:15,343 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 89 treesize of output 88 [2018-10-26 21:54:15,352 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-10-26 21:54:15,353 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:15,389 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:54:15,677 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 86 treesize of output 93 [2018-10-26 21:54:15,686 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 85 treesize of output 79 [2018-10-26 21:54:15,687 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:15,863 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:54:15,873 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 76 treesize of output 82 [2018-10-26 21:54:15,873 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:15,987 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:54:16,082 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:54:16,264 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:54:16,307 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 149 treesize of output 105 [2018-10-26 21:54:16,326 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:54:16,339 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 95 treesize of output 118 [2018-10-26 21:54:16,340 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:16,445 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 0 case distinctions, treesize of input 114 treesize of output 87 [2018-10-26 21:54:16,451 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-10-26 21:54:16,451 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:16,510 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 83 treesize of output 69 [2018-10-26 21:54:16,516 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 21:54:16,526 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 66 treesize of output 76 [2018-10-26 21:54:16,527 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:16,555 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:54:16,581 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:54:16,614 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:54:16,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-26 21:54:16,762 INFO L202 ElimStorePlain]: Needed 52 recursive calls to eliminate 12 variables, input treesize:319, output treesize:90 [2018-10-26 21:54:19,068 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 44 treesize of output 40 [2018-10-26 21:54:19,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 21:54:19,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:19,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:54:19,130 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 30 treesize of output 24 [2018-10-26 21:54:19,132 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 11 [2018-10-26 21:54:19,132 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:19,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:54:19,183 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 33 treesize of output 29 [2018-10-26 21:54:19,185 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-10-26 21:54:19,185 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:19,192 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:54:19,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-10-26 21:54:19,232 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 7 [2018-10-26 21:54:19,232 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:19,236 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:54:19,270 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 37 treesize of output 31 [2018-10-26 21:54:19,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2018-10-26 21:54:19,273 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:19,280 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:54:19,316 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-10-26 21:54:19,321 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 17 treesize of output 12 [2018-10-26 21:54:19,321 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:19,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-10-26 21:54:19,339 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-26 21:54:19,351 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:54:19,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:54:19,373 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 10 variables, input treesize:115, output treesize:19 [2018-10-26 21:54:19,533 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-10-26 21:54:19,542 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-10-26 21:54:19,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-26 21:54:19,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 21:54:19,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 21:54:19,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2018-10-26 21:54:19,559 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 21:54:19,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:54:19,857 WARN L179 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-26 21:54:20,022 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-26 21:54:20,296 WARN L179 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-10-26 21:54:20,530 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-10-26 21:54:24,002 WARN L179 SmtUtils]: Spent 3.47 s on a formula simplification that was a NOOP. DAG size: 146 [2018-10-26 21:54:25,056 WARN L179 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 73 [2018-10-26 21:54:26,876 WARN L179 SmtUtils]: Spent 1.82 s on a formula simplification that was a NOOP. DAG size: 93 [2018-10-26 21:54:28,224 WARN L179 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 85 [2018-10-26 21:54:36,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:54:36,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 45 [2018-10-26 21:54:36,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-26 21:54:36,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-26 21:54:36,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2011, Unknown=25, NotChecked=276, Total=2450 [2018-10-26 21:54:36,210 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 45 states. [2018-10-26 21:54:37,280 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-10-26 21:54:43,505 WARN L179 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2018-10-26 21:54:47,913 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|node_create_write~intINTTYPE4_#value| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.base| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.offset| (_ BitVec 32)) (sll_insert_~new_node~0.base (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (|sll_insert_write~$Pointer$_#value.offset| (_ BitVec 32)) (|sll_insert_write~$Pointer$_#value.base| (_ BitVec 32))) (let ((.cse5 (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) |node_create_write~$Pointer$_#value.offset|))) (.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) |node_create_write~$Pointer$_#value.base|)))) (let ((.cse2 (select (select .cse1 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|)) (.cse3 (bvadd (select (select .cse5 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|) (_ bv4 32)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_5)))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) (_ bv4 32) |sll_insert_write~$Pointer$_#value.base|)))) (= (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_write~intINTTYPE4_#value|)) |c_#memory_int|) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base)) (= (let ((.cse4 (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 v_prenex_4)))) (store .cse4 sll_insert_~new_node~0.base (store (select .cse4 sll_insert_~new_node~0.base) (_ bv4 32) |sll_insert_write~$Pointer$_#value.offset|))) |c_#memory_$Pointer$.offset|))))) (exists ((|node_create_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|node_create_write~intINTTYPE4_#value| (_ BitVec 32)) (|sll_insert_write~$Pointer$_#ptr.offset| (_ BitVec 32)) (|node_create_write~intINTTYPE4_#ptr.offset| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.base| (_ BitVec 32)) (|node_create_write~$Pointer$_#value.offset| (_ BitVec 32)) (sll_insert_~new_node~0.base (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (|sll_insert_write~$Pointer$_#value.offset| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (|sll_insert_write~$Pointer$_#value.base| (_ BitVec 32))) (let ((.cse10 (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) |node_create_write~$Pointer$_#ptr.offset| |node_create_write~$Pointer$_#value.base|)))) (let ((.cse8 (select (select .cse10 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) (and (= (let ((.cse6 (let ((.cse7 (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) |node_create_write~$Pointer$_#ptr.offset| |node_create_write~$Pointer$_#value.offset|)))) (store .cse7 .cse8 (store (select .cse7 .cse8) v_prenex_1 v_prenex_2))))) (store .cse6 sll_insert_~new_node~0.base (store (select .cse6 sll_insert_~new_node~0.base) |sll_insert_write~$Pointer$_#ptr.offset| |sll_insert_write~$Pointer$_#value.offset|))) |c_#memory_$Pointer$.offset|) (= (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_write~intINTTYPE4_#ptr.offset| |node_create_write~intINTTYPE4_#value|)) |c_#memory_int|) (= (let ((.cse9 (store .cse10 .cse8 (store (select .cse10 .cse8) v_prenex_1 v_prenex_3)))) (store .cse9 sll_insert_~new_node~0.base (store (select .cse9 sll_insert_~new_node~0.base) |sll_insert_write~$Pointer$_#ptr.offset| |sll_insert_write~$Pointer$_#value.base|))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base))))))) is different from true [2018-10-26 21:54:49,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:54:49,177 INFO L93 Difference]: Finished difference Result 105 states and 137 transitions. [2018-10-26 21:54:49,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-26 21:54:49,178 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 56 [2018-10-26 21:54:49,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:54:49,179 INFO L225 Difference]: With dead ends: 105 [2018-10-26 21:54:49,179 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 21:54:49,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 47.6s TimeCoverageRelationStatistics Valid=245, Invalid=3518, Unknown=35, NotChecked=492, Total=4290 [2018-10-26 21:54:49,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 21:54:49,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 21:54:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 21:54:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 21:54:49,181 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2018-10-26 21:54:49,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:54:49,181 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 21:54:49,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-26 21:54:49,181 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 21:54:49,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 21:54:49,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 21:54:49,647 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2018-10-26 21:54:49,650 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 561 563) no Hoare annotation was computed. [2018-10-26 21:54:49,650 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 561 563) the Hoare annotation is: true [2018-10-26 21:54:49,650 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 561 563) no Hoare annotation was computed. [2018-10-26 21:54:49,650 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-26 21:54:49,650 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 21:54:49,650 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-10-26 21:54:49,650 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 21:54:49,650 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 587) no Hoare annotation was computed. [2018-10-26 21:54:49,651 INFO L425 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 582 588) no Hoare annotation was computed. [2018-10-26 21:54:49,651 INFO L428 ceAbstractionStarter]: At program point L583-3(lines 583 587) the Hoare annotation is: true [2018-10-26 21:54:49,651 INFO L428 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 582 588) the Hoare annotation is: true [2018-10-26 21:54:49,651 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 582 588) no Hoare annotation was computed. [2018-10-26 21:54:49,651 INFO L421 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (let ((.cse1 (= |sll_create_#in~data| sll_create_~data)) (.cse0 (bvsgt sll_create_~len (_ bv0 32)))) (or (and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (or (and (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt |sll_create_#in~len| (_ bv0 32))) .cse0) .cse1 (= (_ bv0 32) sll_create_~head~0.offset) (= |sll_create_#in~data| (select (select |#memory_int| sll_create_~head~0.base) (_ bv0 32)))) (and .cse1 (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |old(#memory_int)| |#memory_int|) .cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) [2018-10-26 21:54:49,651 INFO L425 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-10-26 21:54:49,651 INFO L425 ceAbstractionStarter]: For program point sll_createEXIT(lines 573 581) no Hoare annotation was computed. [2018-10-26 21:54:49,651 INFO L425 ceAbstractionStarter]: For program point L575-1(lines 575 579) no Hoare annotation was computed. [2018-10-26 21:54:49,651 INFO L425 ceAbstractionStarter]: For program point L575-3(lines 575 579) no Hoare annotation was computed. [2018-10-26 21:54:49,651 INFO L421 ceAbstractionStarter]: At program point L575-4(lines 575 579) 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 (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) .cse0 (= (_ bv0 32) sll_create_~head~0.offset) (= |sll_create_#in~data| (select (select |#memory_int| sll_create_~head~0.base) (_ bv0 32)))))) [2018-10-26 21:54:49,651 INFO L425 ceAbstractionStarter]: For program point L575-5(lines 575 579) no Hoare annotation was computed. [2018-10-26 21:54:49,652 INFO L421 ceAbstractionStarter]: At program point sll_createENTRY(lines 573 581) 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-10-26 21:54:49,652 INFO L425 ceAbstractionStarter]: For program point sll_createFINAL(lines 573 581) no Hoare annotation was computed. [2018-10-26 21:54:49,652 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 21:54:49,652 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 21:54:49,652 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 21:54:49,652 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 21:54:49,652 INFO L425 ceAbstractionStarter]: For program point L598-1(lines 598 602) no Hoare annotation was computed. [2018-10-26 21:54:49,652 INFO L421 ceAbstractionStarter]: At program point sll_insertENTRY(lines 589 604) 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-10-26 21:54:49,652 INFO L425 ceAbstractionStarter]: For program point L593-1(lines 593 597) no Hoare annotation was computed. [2018-10-26 21:54:49,652 INFO L421 ceAbstractionStarter]: At program point L590(line 590) 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-10-26 21:54:49,652 INFO L428 ceAbstractionStarter]: At program point L593-3(lines 593 597) the Hoare annotation is: true [2018-10-26 21:54:49,652 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-10-26 21:54:49,652 INFO L425 ceAbstractionStarter]: For program point L593-4(lines 589 604) no Hoare annotation was computed. [2018-10-26 21:54:49,653 INFO L425 ceAbstractionStarter]: For program point sll_insertEXIT(lines 589 604) no Hoare annotation was computed. [2018-10-26 21:54:49,653 INFO L425 ceAbstractionStarter]: For program point sll_insertFINAL(lines 589 604) no Hoare annotation was computed. [2018-10-26 21:54:49,653 INFO L428 ceAbstractionStarter]: At program point L638(line 638) the Hoare annotation is: true [2018-10-26 21:54:49,653 INFO L425 ceAbstractionStarter]: For program point L638-1(line 638) no Hoare annotation was computed. [2018-10-26 21:54:49,653 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 605 642) no Hoare annotation was computed. [2018-10-26 21:54:49,653 INFO L425 ceAbstractionStarter]: For program point L622(lines 622 624) no Hoare annotation was computed. [2018-10-26 21:54:49,653 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 640) no Hoare annotation was computed. [2018-10-26 21:54:49,653 INFO L425 ceAbstractionStarter]: For program point L614-1(lines 614 621) no Hoare annotation was computed. [2018-10-26 21:54:49,653 INFO L421 ceAbstractionStarter]: At program point L614-3(lines 614 621) the Hoare annotation is: (and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~mid_index~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-10-26 21:54:49,653 INFO L425 ceAbstractionStarter]: For program point L614-4(lines 614 621) no Hoare annotation was computed. [2018-10-26 21:54:49,653 INFO L425 ceAbstractionStarter]: For program point L627-1(lines 627 634) no Hoare annotation was computed. [2018-10-26 21:54:49,654 INFO L421 ceAbstractionStarter]: At program point L627-3(lines 627 634) the Hoare annotation is: (and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~mid_index~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-10-26 21:54:49,654 INFO L425 ceAbstractionStarter]: For program point L627-4(lines 605 642) no Hoare annotation was computed. [2018-10-26 21:54:49,654 INFO L421 ceAbstractionStarter]: At program point L611(line 611) 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)) (= (bvadd (select |#valid| .cse0) (_ bv1 1)) (_ bv0 1)) (= (select (select |#memory_int| .cse0) (_ bv0 32)) main_~data~0) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~mid_index~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-10-26 21:54:49,654 INFO L425 ceAbstractionStarter]: For program point L611-1(line 611) no Hoare annotation was computed. [2018-10-26 21:54:49,654 INFO L421 ceAbstractionStarter]: At program point L636(lines 605 642) the Hoare annotation is: (and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~mid_index~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-10-26 21:54:49,654 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 605 642) no Hoare annotation was computed. [2018-10-26 21:54:49,654 INFO L425 ceAbstractionStarter]: For program point L616(lines 616 618) no Hoare annotation was computed. [2018-10-26 21:54:49,654 INFO L421 ceAbstractionStarter]: At program point L608(line 608) 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-10-26 21:54:49,654 INFO L425 ceAbstractionStarter]: For program point L608-1(line 608) no Hoare annotation was computed. [2018-10-26 21:54:49,654 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 605 642) 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-10-26 21:54:49,654 INFO L425 ceAbstractionStarter]: For program point L629(lines 629 631) no Hoare annotation was computed. [2018-10-26 21:54:49,655 INFO L421 ceAbstractionStarter]: At program point node_createENTRY(lines 564 572) 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-10-26 21:54:49,655 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 564 572) no Hoare annotation was computed. [2018-10-26 21:54:49,655 INFO L428 ceAbstractionStarter]: At program point L567(line 567) the Hoare annotation is: true [2018-10-26 21:54:49,655 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-10-26 21:54:49,655 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 564 572) no Hoare annotation was computed. [2018-10-26 21:54:49,655 INFO L425 ceAbstractionStarter]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2018-10-26 21:54:49,679 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:54:49,680 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:54:49,680 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:54:49,680 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:54:49,680 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:54:49,681 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:54:49,681 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:54:49,681 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:54:49,681 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:54:49,681 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:54:49,681 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:54:49,682 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:54:49,682 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:54:49,682 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:54:49,682 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:54:49,682 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:54:49,683 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:54:49,683 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:54:49,683 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:54:49,683 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:54:49,688 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:54:49,688 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:54:49,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:54:49 BoogieIcfgContainer [2018-10-26 21:54:49,690 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:54:49,691 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 21:54:49,691 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 21:54:49,691 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 21:54:49,693 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:51:39" (3/4) ... [2018-10-26 21:54:49,697 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 21:54:49,703 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exit [2018-10-26 21:54:49,703 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 21:54:49,703 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2018-10-26 21:54:49,704 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-10-26 21:54:49,704 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_insert [2018-10-26 21:54:49,704 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 21:54:49,704 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-10-26 21:54:49,711 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 60 nodes and edges [2018-10-26 21:54:49,711 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-10-26 21:54:49,711 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-26 21:54:49,732 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$) || (((1bv1 == \valid[head] && \old(data) == data) && 0bv32 == head) && \old(data) == unknown-#memory_int-unknown[head][0bv32]) [2018-10-26 21:54:49,757 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_64e86d3e-e568-4987-9f7b-703073c72310/bin-2019/utaipan/witness.graphml [2018-10-26 21:54:49,757 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 21:54:49,758 INFO L168 Benchmark]: Toolchain (without parser) took 191149.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 262.7 MB). Free memory was 943.9 MB in the beginning and 921.7 MB in the end (delta: 22.2 MB). Peak memory consumption was 284.9 MB. Max. memory is 11.5 GB. [2018-10-26 21:54:49,759 INFO L168 Benchmark]: CDTParser took 0.17 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-10-26 21:54:49,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.06 ms. Allocated memory is still 1.0 GB. Free memory was 943.9 MB in the beginning and 922.4 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-26 21:54:49,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.80 ms. Allocated memory is still 1.0 GB. Free memory was 922.4 MB in the beginning and 917.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 21:54:49,761 INFO L168 Benchmark]: Boogie Preprocessor took 128.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 917.0 MB in the beginning and 1.2 GB in the end (delta: -240.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2018-10-26 21:54:49,762 INFO L168 Benchmark]: RCFGBuilder took 730.02 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: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-10-26 21:54:49,762 INFO L168 Benchmark]: TraceAbstraction took 189716.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.3 MB). Free memory was 1.1 GB in the beginning and 921.7 MB in the end (delta: 192.3 MB). Peak memory consumption was 284.5 MB. Max. memory is 11.5 GB. [2018-10-26 21:54:49,762 INFO L168 Benchmark]: Witness Printer took 66.89 ms. Allocated memory is still 1.3 GB. Free memory is still 921.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:54:49,764 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.17 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 439.06 ms. Allocated memory is still 1.0 GB. Free memory was 943.9 MB in the beginning and 922.4 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.80 ms. Allocated memory is still 1.0 GB. Free memory was 922.4 MB in the beginning and 917.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 128.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 917.0 MB in the beginning and 1.2 GB in the end (delta: -240.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 730.02 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: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 189716.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.3 MB). Free memory was 1.1 GB in the beginning and 921.7 MB in the end (delta: 192.3 MB). Peak memory consumption was 284.5 MB. Max. memory is 11.5 GB. * Witness Printer took 66.89 ms. Allocated memory is still 1.3 GB. Free memory is still 921.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 640]: 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: 627]: Loop Invariant Derived loop invariant: (s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(mid_index, 4294967295bv32) == 0bv32 - InvariantResult [Line: 614]: Loop Invariant Derived loop invariant: (s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(mid_index, 4294967295bv32) == 0bv32 - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: (s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(mid_index, 4294967295bv32) == 0bv32 - InvariantResult [Line: 575]: Loop Invariant [2018-10-26 21:54:49,784 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:54:49,784 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:54:49,784 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:54:49,784 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:54:49,785 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:54:49,785 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:54:49,785 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:54:49,785 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:54:49,785 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:54:49,785 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:54:49,785 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:54:49,786 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:54:49,786 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 21:54:49,786 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:54:49,786 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 21:54:49,787 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:54:49,787 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 21:54:49,787 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:54:49,787 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:54:49,787 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:54:49,787 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 21:54:49,787 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$) || (((1bv1 == \valid[head] && \old(data) == data) && 0bv32 == head) && \old(data) == unknown-#memory_int-unknown[head][0bv32]) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 60 locations, 1 error locations. SAFE Result, 189.6s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 13.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 298 SDtfs, 212 SDslu, 1341 SDs, 0 SdLazy, 1212 SolverSat, 51 SolverUnsat, 66 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 467 GetRequests, 376 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 48.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, 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, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 50 PreInvPairs, 76 NumberOfFragments, 286 HoareAnnotationTreeSize, 50 FomulaSimplifications, 861 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 21 FomulaSimplificationsInter, 173 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 174.0s InterpolantComputationTime, 354 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 432 ConstructedInterpolants, 39 QuantifiedInterpolants, 218659 SizeOfPredicates, 176 NumberOfNonLiveVariables, 2071 ConjunctsInSsa, 252 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 63/104 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...