./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.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_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/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 1b97bc973900e2f9596f533e03f1df56d5945f81 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/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 1b97bc973900e2f9596f533e03f1df56d5945f81 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 01:48:13,392 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:48:13,393 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:48:13,400 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:48:13,400 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:48:13,401 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:48:13,402 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:48:13,403 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:48:13,404 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:48:13,404 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:48:13,405 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:48:13,405 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:48:13,406 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:48:13,407 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:48:13,407 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:48:13,408 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:48:13,408 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:48:13,409 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:48:13,410 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:48:13,411 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:48:13,412 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:48:13,413 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:48:13,415 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:48:13,415 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:48:13,415 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:48:13,416 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:48:13,417 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:48:13,417 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:48:13,418 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:48:13,419 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:48:13,419 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:48:13,419 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:48:13,419 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:48:13,420 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:48:13,420 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:48:13,421 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:48:13,421 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 01:48:13,431 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:48:13,432 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:48:13,432 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 01:48:13,432 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 01:48:13,433 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 01:48:13,433 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 01:48:13,433 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 01:48:13,433 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 01:48:13,433 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 01:48:13,433 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 01:48:13,433 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 01:48:13,434 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:48:13,434 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 01:48:13,434 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 01:48:13,434 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 01:48:13,434 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:48:13,435 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 01:48:13,435 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 01:48:13,435 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 01:48:13,435 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 01:48:13,435 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 01:48:13,435 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 01:48:13,435 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:48:13,435 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:48:13,436 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 01:48:13,436 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 01:48:13,436 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 01:48:13,436 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:48:13,436 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 01:48:13,436 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 01:48:13,436 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 01:48:13,437 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 01:48:13,437 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 01:48:13,437 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 01:48:13,437 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_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/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 -> 1b97bc973900e2f9596f533e03f1df56d5945f81 [2018-11-10 01:48:13,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:48:13,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:48:13,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:48:13,473 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:48:13,474 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:48:13,474 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-11-10 01:48:13,519 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/data/dcce3c792/76a3fa9d836f4d1cbe3c699f72abeb77/FLAG437ae6829 [2018-11-10 01:48:13,858 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:48:13,859 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-11-10 01:48:13,866 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/data/dcce3c792/76a3fa9d836f4d1cbe3c699f72abeb77/FLAG437ae6829 [2018-11-10 01:48:13,874 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/data/dcce3c792/76a3fa9d836f4d1cbe3c699f72abeb77 [2018-11-10 01:48:13,877 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:48:13,878 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 01:48:13,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:48:13,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:48:13,881 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:48:13,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:48:13" (1/1) ... [2018-11-10 01:48:13,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fce3983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:13, skipping insertion in model container [2018-11-10 01:48:13,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:48:13" (1/1) ... [2018-11-10 01:48:13,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:48:13,924 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:48:14,131 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:48:14,137 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:48:14,174 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:48:14,199 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:48:14,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:14 WrapperNode [2018-11-10 01:48:14,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:48:14,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 01:48:14,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 01:48:14,200 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 01:48:14,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:14" (1/1) ... [2018-11-10 01:48:14,255 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:14" (1/1) ... [2018-11-10 01:48:14,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 01:48:14,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:48:14,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:48:14,271 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:48:14,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:14" (1/1) ... [2018-11-10 01:48:14,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:14" (1/1) ... [2018-11-10 01:48:14,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:14" (1/1) ... [2018-11-10 01:48:14,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:14" (1/1) ... [2018-11-10 01:48:14,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:14" (1/1) ... [2018-11-10 01:48:14,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:14" (1/1) ... [2018-11-10 01:48:14,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:14" (1/1) ... [2018-11-10 01:48:14,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:48:14,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:48:14,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:48:14,297 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:48:14,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/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-11-10 01:48:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-10 01:48:14,332 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-10 01:48:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2018-11-10 01:48:14,332 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2018-11-10 01:48:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 01:48:14,332 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-10 01:48:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-10 01:48:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-10 01:48:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 01:48:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 01:48:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2018-11-10 01:48:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2018-11-10 01:48:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 01:48:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 01:48:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:48:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:48:14,334 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-11-10 01:48:14,334 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-11-10 01:48:14,607 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:48:14,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:48:14 BoogieIcfgContainer [2018-11-10 01:48:14,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:48:14,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 01:48:14,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 01:48:14,611 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 01:48:14,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:48:13" (1/3) ... [2018-11-10 01:48:14,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5607487b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:48:14, skipping insertion in model container [2018-11-10 01:48:14,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:14" (2/3) ... [2018-11-10 01:48:14,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5607487b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:48:14, skipping insertion in model container [2018-11-10 01:48:14,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:48:14" (3/3) ... [2018-11-10 01:48:14,613 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-11-10 01:48:14,619 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 01:48:14,625 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 01:48:14,639 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 01:48:14,661 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 01:48:14,661 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 01:48:14,661 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 01:48:14,661 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:48:14,661 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:48:14,661 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 01:48:14,661 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:48:14,661 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 01:48:14,673 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-11-10 01:48:14,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 01:48:14,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:48:14,678 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:48:14,680 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:48:14,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:14,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1371276736, now seen corresponding path program 1 times [2018-11-10 01:48:14,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:48:14,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:48:14,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:48:14,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:48:14,732 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:48:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:48:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 01:48:14,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:48:14,799 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 01:48:14,800 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-10 01:48:14,802 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [40], [42], [43], [44], [65], [67], [68], [104], [106], [108], [131], [133], [135], [138], [143], [146], [158], [160], [161], [164], [165], [166], [170], [171], [172], [173], [174], [175], [180], [181] [2018-11-10 01:48:14,841 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 01:48:14,841 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 01:48:14,940 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 01:48:14,941 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Never found a fixpoint. Largest state had 41 variables. [2018-11-10 01:48:14,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:14,946 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 01:48:15,015 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 93.65% of their original sizes. [2018-11-10 01:48:15,015 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 01:48:15,039 INFO L415 sIntCurrentIteration]: We unified 36 AI predicates to 36 [2018-11-10 01:48:15,039 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 01:48:15,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:48:15,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [2] total 4 [2018-11-10 01:48:15,040 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:48:15,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:48:15,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:48:15,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:48:15,047 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states. [2018-11-10 01:48:15,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:48:15,159 INFO L93 Difference]: Finished difference Result 155 states and 202 transitions. [2018-11-10 01:48:15,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:48:15,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-10 01:48:15,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:48:15,169 INFO L225 Difference]: With dead ends: 155 [2018-11-10 01:48:15,169 INFO L226 Difference]: Without dead ends: 73 [2018-11-10 01:48:15,172 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:48:15,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-10 01:48:15,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2018-11-10 01:48:15,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-10 01:48:15,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2018-11-10 01:48:15,210 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 37 [2018-11-10 01:48:15,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:48:15,210 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2018-11-10 01:48:15,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:48:15,210 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2018-11-10 01:48:15,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 01:48:15,212 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:48:15,212 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:48:15,212 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:48:15,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:15,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1168073775, now seen corresponding path program 1 times [2018-11-10 01:48:15,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:48:15,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:48:15,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:48:15,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:48:15,214 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:48:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:48:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 01:48:15,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:48:15,320 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 01:48:15,320 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-11-10 01:48:15,321 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [27], [32], [36], [42], [43], [44], [48], [50], [53], [67], [68], [104], [106], [108], [112], [114], [117], [123], [133], [135], [138], [143], [146], [150], [154], [160], [161], [164], [165], [166], [170], [171], [172], [173], [174], [175], [180], [181] [2018-11-10 01:48:15,323 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 01:48:15,323 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 01:48:15,339 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 01:48:15,339 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Never found a fixpoint. Largest state had 43 variables. [2018-11-10 01:48:15,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:15,368 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 01:48:15,407 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 89.14% of their original sizes. [2018-11-10 01:48:15,407 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 01:48:15,469 INFO L415 sIntCurrentIteration]: We unified 48 AI predicates to 48 [2018-11-10 01:48:15,469 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 01:48:15,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:48:15,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-10 01:48:15,469 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:48:15,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:48:15,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:48:15,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:48:15,471 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 5 states. [2018-11-10 01:48:15,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:48:15,619 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2018-11-10 01:48:15,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:48:15,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-11-10 01:48:15,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:48:15,621 INFO L225 Difference]: With dead ends: 132 [2018-11-10 01:48:15,621 INFO L226 Difference]: Without dead ends: 73 [2018-11-10 01:48:15,622 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 01:48:15,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-10 01:48:15,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-11-10 01:48:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-10 01:48:15,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2018-11-10 01:48:15,631 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 49 [2018-11-10 01:48:15,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:48:15,631 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2018-11-10 01:48:15,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:48:15,631 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-11-10 01:48:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 01:48:15,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:48:15,633 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:48:15,633 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:48:15,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:15,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1755086223, now seen corresponding path program 1 times [2018-11-10 01:48:15,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:48:15,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:48:15,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:48:15,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:48:15,635 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:48:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:48:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 01:48:15,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:48:15,869 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 01:48:15,869 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-11-10 01:48:15,869 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [27], [30], [32], [36], [42], [43], [44], [48], [50], [53], [67], [68], [104], [106], [108], [112], [114], [117], [123], [133], [135], [138], [143], [146], [150], [154], [160], [161], [164], [165], [166], [170], [171], [172], [173], [174], [175], [180], [181] [2018-11-10 01:48:15,872 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 01:48:15,872 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 01:48:15,926 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 01:48:15,926 INFO L272 AbstractInterpreter]: Visited 21 different actions 21 times. Never merged. Never widened. Never found a fixpoint. Largest state had 43 variables. [2018-11-10 01:48:15,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:15,944 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 01:48:16,023 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 79.31% of their original sizes. [2018-11-10 01:48:16,023 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 01:48:16,283 INFO L415 sIntCurrentIteration]: We unified 48 AI predicates to 48 [2018-11-10 01:48:16,283 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 01:48:16,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:48:16,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [10] total 22 [2018-11-10 01:48:16,283 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:48:16,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 01:48:16,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 01:48:16,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-10 01:48:16,285 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 14 states. [2018-11-10 01:48:18,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:48:18,685 INFO L93 Difference]: Finished difference Result 148 states and 173 transitions. [2018-11-10 01:48:18,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 01:48:18,685 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2018-11-10 01:48:18,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:48:18,687 INFO L225 Difference]: With dead ends: 148 [2018-11-10 01:48:18,687 INFO L226 Difference]: Without dead ends: 104 [2018-11-10 01:48:18,687 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2018-11-10 01:48:18,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-10 01:48:18,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2018-11-10 01:48:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-10 01:48:18,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2018-11-10 01:48:18,702 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 49 [2018-11-10 01:48:18,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:48:18,702 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2018-11-10 01:48:18,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 01:48:18,702 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2018-11-10 01:48:18,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 01:48:18,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:48:18,704 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:48:18,704 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:48:18,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:18,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1063567847, now seen corresponding path program 1 times [2018-11-10 01:48:18,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:48:18,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:48:18,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:48:18,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:48:18,708 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:48:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:48:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 01:48:18,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:48:18,777 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 01:48:18,777 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-10 01:48:18,777 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [27], [30], [32], [36], [38], [42], [43], [44], [48], [50], [53], [67], [68], [104], [106], [108], [112], [114], [117], [123], [133], [135], [138], [143], [146], [150], [154], [160], [161], [164], [165], [166], [170], [171], [172], [173], [174], [175], [180], [181] [2018-11-10 01:48:18,778 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 01:48:18,778 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 01:48:18,852 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 01:48:18,852 INFO L272 AbstractInterpreter]: Visited 22 different actions 67 times. Merged at 10 different actions 27 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 43 variables. [2018-11-10 01:48:18,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:18,854 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 01:48:18,908 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 79.36% of their original sizes. [2018-11-10 01:48:18,908 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 01:48:19,354 INFO L415 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-11-10 01:48:19,354 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 01:48:19,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:48:19,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-11-10 01:48:19,355 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:48:19,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 01:48:19,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 01:48:19,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-11-10 01:48:19,355 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 17 states. [2018-11-10 01:48:22,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:48:22,552 INFO L93 Difference]: Finished difference Result 135 states and 156 transitions. [2018-11-10 01:48:22,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 01:48:22,552 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-10 01:48:22,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:48:22,553 INFO L225 Difference]: With dead ends: 135 [2018-11-10 01:48:22,553 INFO L226 Difference]: Without dead ends: 91 [2018-11-10 01:48:22,554 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2018-11-10 01:48:22,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-10 01:48:22,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2018-11-10 01:48:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 01:48:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2018-11-10 01:48:22,567 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 53 [2018-11-10 01:48:22,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:48:22,568 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2018-11-10 01:48:22,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 01:48:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2018-11-10 01:48:22,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 01:48:22,569 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:48:22,569 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:48:22,569 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:48:22,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:22,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2007461340, now seen corresponding path program 1 times [2018-11-10 01:48:22,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:48:22,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:48:22,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:48:22,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:48:22,571 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:48:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:48:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 01:48:22,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:48:22,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 01:48:22,655 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:48:22,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 01:48:22,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 01:48:22,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 01:48:22,657 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 10 states. [2018-11-10 01:48:22,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:48:22,775 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2018-11-10 01:48:22,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 01:48:22,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-10 01:48:22,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:48:22,777 INFO L225 Difference]: With dead ends: 96 [2018-11-10 01:48:22,777 INFO L226 Difference]: Without dead ends: 92 [2018-11-10 01:48:22,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-11-10 01:48:22,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-10 01:48:22,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2018-11-10 01:48:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-10 01:48:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2018-11-10 01:48:22,790 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 54 [2018-11-10 01:48:22,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:48:22,791 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2018-11-10 01:48:22,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 01:48:22,792 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2018-11-10 01:48:22,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 01:48:22,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:48:22,793 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:48:22,793 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:48:22,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:22,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1331625310, now seen corresponding path program 1 times [2018-11-10 01:48:22,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:48:22,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:48:22,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:48:22,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:48:22,794 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:48:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:48:22,945 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 01:48:22,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:48:22,945 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 01:48:22,945 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-11-10 01:48:22,945 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [27], [30], [32], [36], [42], [43], [44], [48], [50], [53], [55], [61], [63], [67], [68], [104], [106], [108], [112], [114], [117], [123], [133], [135], [138], [143], [146], [150], [154], [156], [160], [161], [164], [165], [166], [170], [171], [172], [173], [174], [175], [180], [181] [2018-11-10 01:48:22,947 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 01:48:22,947 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 01:48:23,032 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 01:48:23,032 INFO L272 AbstractInterpreter]: Visited 34 different actions 61 times. Merged at 8 different actions 16 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 43 variables. [2018-11-10 01:48:23,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:23,039 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 01:48:23,123 INFO L227 lantSequenceWeakener]: Weakened 33 states. On average, predicates are now at 81.29% of their original sizes. [2018-11-10 01:48:23,124 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 01:48:23,650 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-11-10 01:48:23,650 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 01:48:23,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:48:23,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [10] total 36 [2018-11-10 01:48:23,650 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:48:23,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-10 01:48:23,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-10 01:48:23,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2018-11-10 01:48:23,651 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand 28 states. [2018-11-10 01:48:28,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:48:28,573 INFO L93 Difference]: Finished difference Result 202 states and 243 transitions. [2018-11-10 01:48:28,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 01:48:28,573 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2018-11-10 01:48:28,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:48:28,574 INFO L225 Difference]: With dead ends: 202 [2018-11-10 01:48:28,574 INFO L226 Difference]: Without dead ends: 152 [2018-11-10 01:48:28,576 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 74 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=222, Invalid=1940, Unknown=0, NotChecked=0, Total=2162 [2018-11-10 01:48:28,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-10 01:48:28,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2018-11-10 01:48:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-10 01:48:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2018-11-10 01:48:28,595 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 56 [2018-11-10 01:48:28,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:48:28,595 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2018-11-10 01:48:28,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-10 01:48:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2018-11-10 01:48:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 01:48:28,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:48:28,596 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:48:28,597 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:48:28,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:28,597 INFO L82 PathProgramCache]: Analyzing trace with hash -806050654, now seen corresponding path program 1 times [2018-11-10 01:48:28,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:48:28,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:48:28,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:48:28,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:48:28,598 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:48:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:48:28,661 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 01:48:28,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:48:28,661 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 01:48:28,661 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-11-10 01:48:28,661 INFO L202 CegarAbsIntRunner]: [4], [5], [21], [25], [27], [30], [36], [42], [43], [44], [48], [50], [53], [55], [61], [63], [67], [68], [104], [106], [108], [112], [114], [119], [123], [133], [135], [138], [143], [146], [150], [154], [156], [160], [161], [164], [165], [166], [170], [171], [172], [173], [174], [175], [180], [181] [2018-11-10 01:48:28,663 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 01:48:28,663 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 01:48:28,881 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 01:48:28,881 INFO L272 AbstractInterpreter]: Visited 46 different actions 180 times. Merged at 15 different actions 110 times. Widened at 1 different actions 10 times. Found 17 fixpoints after 5 different actions. Largest state had 43 variables. [2018-11-10 01:48:28,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:28,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 01:48:28,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:48:28,889 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/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-11-10 01:48:28,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:48:28,895 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 01:48:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:48:28,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:48:28,959 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 01:48:28,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:48:29,101 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 01:48:29,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 01:48:29,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 15 [2018-11-10 01:48:29,118 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 01:48:29,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 01:48:29,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 01:48:29,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-11-10 01:48:29,118 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand 10 states. [2018-11-10 01:48:29,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:48:29,197 INFO L93 Difference]: Finished difference Result 213 states and 248 transitions. [2018-11-10 01:48:29,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 01:48:29,197 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-10 01:48:29,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:48:29,198 INFO L225 Difference]: With dead ends: 213 [2018-11-10 01:48:29,198 INFO L226 Difference]: Without dead ends: 133 [2018-11-10 01:48:29,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 103 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-11-10 01:48:29,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-10 01:48:29,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-11-10 01:48:29,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-10 01:48:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2018-11-10 01:48:29,220 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 56 [2018-11-10 01:48:29,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:48:29,220 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2018-11-10 01:48:29,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 01:48:29,220 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2018-11-10 01:48:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-10 01:48:29,221 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:48:29,221 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:48:29,222 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:48:29,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:29,222 INFO L82 PathProgramCache]: Analyzing trace with hash -845145385, now seen corresponding path program 2 times [2018-11-10 01:48:29,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:48:29,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:48:29,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:48:29,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:48:29,225 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:48:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:48:29,256 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.smtinterpol.util.Coercion.buildApp(Coercion.java:60) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator$PathInfo$PathEnd.mergeCongPath(CCInterpolator.java:293) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator$PathInfo$PathEnd.access$0(CCInterpolator.java:241) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator$PathInfo.interpolatePathInfo(CCInterpolator.java:376) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator$PathInfo$PathEnd.mergeCongPath(CCInterpolator.java:258) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator$PathInfo$PathEnd.access$0(CCInterpolator.java:241) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator$PathInfo.interpolatePathInfo(CCInterpolator.java:376) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator.computeInterpolants(CCInterpolator.java:507) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:282) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:919) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) 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-11-10 01:48:29,260 INFO L168 Benchmark]: Toolchain (without parser) took 15382.74 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 589.3 MB). Free memory was 956.5 MB in the beginning and 1.3 GB in the end (delta: -342.6 MB). Peak memory consumption was 246.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:48:29,261 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:48:29,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.36 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 926.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-10 01:48:29,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.2 MB). Free memory was 926.9 MB in the beginning and 1.2 GB in the end (delta: -245.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-11-10 01:48:29,262 INFO L168 Benchmark]: Boogie Preprocessor took 25.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-10 01:48:29,262 INFO L168 Benchmark]: RCFGBuilder took 311.49 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: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-11-10 01:48:29,263 INFO L168 Benchmark]: TraceAbstraction took 14650.85 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 412.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -164.4 MB). Peak memory consumption was 247.6 MB. Max. memory is 11.5 GB. [2018-11-10 01:48:29,266 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 321.36 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 926.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.2 MB). Free memory was 926.9 MB in the beginning and 1.2 GB in the end (delta: -245.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 311.49 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: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14650.85 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 412.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -164.4 MB). Peak memory consumption was 247.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.smtinterpol.util.Coercion.buildApp(Coercion.java:60) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 01:48:30,729 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:48:30,730 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:48:30,737 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:48:30,737 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:48:30,738 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:48:30,738 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:48:30,740 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:48:30,741 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:48:30,741 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:48:30,742 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:48:30,742 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:48:30,743 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:48:30,743 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:48:30,744 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:48:30,745 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:48:30,745 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:48:30,746 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:48:30,748 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:48:30,749 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:48:30,750 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:48:30,751 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:48:30,753 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:48:30,753 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:48:30,753 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:48:30,754 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:48:30,755 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:48:30,755 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:48:30,756 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:48:30,756 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:48:30,757 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:48:30,757 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:48:30,757 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:48:30,757 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:48:30,758 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:48:30,758 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:48:30,759 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 01:48:30,770 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:48:30,770 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:48:30,771 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 01:48:30,771 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 01:48:30,771 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 01:48:30,771 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 01:48:30,772 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 01:48:30,772 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 01:48:30,772 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:48:30,772 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 01:48:30,772 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 01:48:30,772 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:48:30,773 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 01:48:30,773 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 01:48:30,773 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 01:48:30,773 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 01:48:30,773 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 01:48:30,773 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 01:48:30,773 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 01:48:30,773 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 01:48:30,773 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:48:30,774 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:48:30,774 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 01:48:30,774 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 01:48:30,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 01:48:30,774 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:48:30,774 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 01:48:30,774 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 01:48:30,774 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 01:48:30,774 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 01:48:30,774 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 01:48:30,774 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 01:48:30,775 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_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/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 -> 1b97bc973900e2f9596f533e03f1df56d5945f81 [2018-11-10 01:48:30,804 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:48:30,812 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:48:30,814 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:48:30,815 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:48:30,815 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:48:30,815 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-11-10 01:48:30,849 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/data/07d4ca078/ea8149c55ece4767956d5013d4a29f45/FLAGfffe16aa8 [2018-11-10 01:48:31,282 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:48:31,283 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-11-10 01:48:31,291 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/data/07d4ca078/ea8149c55ece4767956d5013d4a29f45/FLAGfffe16aa8 [2018-11-10 01:48:31,299 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/data/07d4ca078/ea8149c55ece4767956d5013d4a29f45 [2018-11-10 01:48:31,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:48:31,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 01:48:31,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:48:31,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:48:31,306 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:48:31,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:48:31" (1/1) ... [2018-11-10 01:48:31,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a2a1194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:31, skipping insertion in model container [2018-11-10 01:48:31,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:48:31" (1/1) ... [2018-11-10 01:48:31,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:48:31,347 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:48:31,577 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:48:31,584 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:48:31,624 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:48:31,661 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:48:31,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:31 WrapperNode [2018-11-10 01:48:31,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:48:31,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 01:48:31,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 01:48:31,662 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 01:48:31,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:31" (1/1) ... [2018-11-10 01:48:31,680 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:31" (1/1) ... [2018-11-10 01:48:31,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 01:48:31,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:48:31,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:48:31,738 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:48:31,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:31" (1/1) ... [2018-11-10 01:48:31,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:31" (1/1) ... [2018-11-10 01:48:31,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:31" (1/1) ... [2018-11-10 01:48:31,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:31" (1/1) ... [2018-11-10 01:48:31,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:31" (1/1) ... [2018-11-10 01:48:31,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:31" (1/1) ... [2018-11-10 01:48:31,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:31" (1/1) ... [2018-11-10 01:48:31,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:48:31,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:48:31,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:48:31,765 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:48:31,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/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-11-10 01:48:31,801 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-10 01:48:31,801 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-10 01:48:31,801 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2018-11-10 01:48:31,801 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2018-11-10 01:48:31,801 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 01:48:31,801 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-10 01:48:31,801 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-10 01:48:31,801 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-10 01:48:31,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 01:48:31,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 01:48:31,802 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2018-11-10 01:48:31,802 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2018-11-10 01:48:31,802 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 01:48:31,802 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 01:48:31,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:48:31,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:48:31,803 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-11-10 01:48:31,803 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-11-10 01:48:32,123 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:48:32,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:48:32 BoogieIcfgContainer [2018-11-10 01:48:32,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:48:32,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 01:48:32,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 01:48:32,128 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 01:48:32,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:48:31" (1/3) ... [2018-11-10 01:48:32,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2c5d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:48:32, skipping insertion in model container [2018-11-10 01:48:32,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:48:31" (2/3) ... [2018-11-10 01:48:32,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2c5d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:48:32, skipping insertion in model container [2018-11-10 01:48:32,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:48:32" (3/3) ... [2018-11-10 01:48:32,130 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-11-10 01:48:32,137 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 01:48:32,143 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 01:48:32,151 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 01:48:32,171 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 01:48:32,172 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 01:48:32,172 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 01:48:32,172 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 01:48:32,172 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:48:32,172 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:48:32,172 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 01:48:32,172 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:48:32,173 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 01:48:32,184 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-11-10 01:48:32,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 01:48:32,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:48:32,191 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:48:32,193 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:48:32,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:32,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1832097035, now seen corresponding path program 1 times [2018-11-10 01:48:32,199 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:48:32,200 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/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-11-10 01:48:32,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:48:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:48:32,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:48:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 01:48:32,278 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:48:32,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:48:32,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 01:48:32,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 01:48:32,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 01:48:32,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 01:48:32,294 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-11-10 01:48:32,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:48:32,314 INFO L93 Difference]: Finished difference Result 130 states and 168 transitions. [2018-11-10 01:48:32,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 01:48:32,316 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-11-10 01:48:32,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:48:32,322 INFO L225 Difference]: With dead ends: 130 [2018-11-10 01:48:32,322 INFO L226 Difference]: Without dead ends: 53 [2018-11-10 01:48:32,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 01:48:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-10 01:48:32,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-10 01:48:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 01:48:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-11-10 01:48:32,354 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 36 [2018-11-10 01:48:32,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:48:32,354 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-11-10 01:48:32,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 01:48:32,354 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-10 01:48:32,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 01:48:32,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:48:32,356 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] [2018-11-10 01:48:32,356 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:48:32,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:32,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1903068379, now seen corresponding path program 1 times [2018-11-10 01:48:32,357 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:48:32,357 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/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-11-10 01:48:32,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:48:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:48:32,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:48:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:48:32,499 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:48:32,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:48:32,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 01:48:32,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 01:48:32,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 01:48:32,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 01:48:32,503 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 9 states. [2018-11-10 01:48:32,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:48:32,672 INFO L93 Difference]: Finished difference Result 116 states and 140 transitions. [2018-11-10 01:48:32,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 01:48:32,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-11-10 01:48:32,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:48:32,676 INFO L225 Difference]: With dead ends: 116 [2018-11-10 01:48:32,676 INFO L226 Difference]: Without dead ends: 80 [2018-11-10 01:48:32,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 01:48:32,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-10 01:48:32,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2018-11-10 01:48:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-10 01:48:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-11-10 01:48:32,690 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 42 [2018-11-10 01:48:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:48:32,690 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-11-10 01:48:32,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 01:48:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-11-10 01:48:32,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 01:48:32,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:48:32,693 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:48:32,693 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:48:32,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:32,693 INFO L82 PathProgramCache]: Analyzing trace with hash 375257663, now seen corresponding path program 1 times [2018-11-10 01:48:32,694 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:48:32,694 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/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-11-10 01:48:32,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:48:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:48:32,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:48:32,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:48:32,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:48:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 01:48:33,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:48:33,128 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:48:33,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:48:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:48:33,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:48:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:48:33,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:48:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 01:48:33,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 01:48:33,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10] total 17 [2018-11-10 01:48:33,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 01:48:33,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 01:48:33,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-11-10 01:48:33,263 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 17 states. [2018-11-10 01:48:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:48:33,866 INFO L93 Difference]: Finished difference Result 146 states and 187 transitions. [2018-11-10 01:48:33,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 01:48:33,868 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-11-10 01:48:33,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:48:33,869 INFO L225 Difference]: With dead ends: 146 [2018-11-10 01:48:33,869 INFO L226 Difference]: Without dead ends: 102 [2018-11-10 01:48:33,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 161 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-11-10 01:48:33,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-10 01:48:33,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 56. [2018-11-10 01:48:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 01:48:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-11-10 01:48:33,882 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 44 [2018-11-10 01:48:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:48:33,882 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-11-10 01:48:33,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 01:48:33,883 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-11-10 01:48:33,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 01:48:33,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:48:33,884 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:48:33,885 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:48:33,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:33,885 INFO L82 PathProgramCache]: Analyzing trace with hash 86349913, now seen corresponding path program 1 times [2018-11-10 01:48:33,886 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:48:33,886 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:48:33,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:48:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:48:33,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:48:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:48:34,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:48:34,374 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 01:48:34,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:48:34,376 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:48:34,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:48:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:48:34,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:48:34,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 01:48:34,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:48:34,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:34,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:34,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:34,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-11-10 01:48:34,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-10 01:48:34,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-10 01:48:34,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:34,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:34,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:34,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-11-10 01:48:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:48:34,798 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:48:34,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:48:34,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10, 10] total 26 [2018-11-10 01:48:34,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-10 01:48:34,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-10 01:48:34,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-11-10 01:48:34,815 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 26 states. [2018-11-10 01:48:51,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:48:51,162 INFO L93 Difference]: Finished difference Result 224 states and 288 transitions. [2018-11-10 01:48:51,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-10 01:48:51,163 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 47 [2018-11-10 01:48:51,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:48:51,164 INFO L225 Difference]: With dead ends: 224 [2018-11-10 01:48:51,165 INFO L226 Difference]: Without dead ends: 185 [2018-11-10 01:48:51,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=239, Invalid=2413, Unknown=0, NotChecked=0, Total=2652 [2018-11-10 01:48:51,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-10 01:48:51,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 92. [2018-11-10 01:48:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-10 01:48:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2018-11-10 01:48:51,185 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 47 [2018-11-10 01:48:51,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:48:51,186 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2018-11-10 01:48:51,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-10 01:48:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2018-11-10 01:48:51,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 01:48:51,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:48:51,187 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:48:51,188 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:48:51,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:51,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1559442879, now seen corresponding path program 1 times [2018-11-10 01:48:51,189 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:48:51,189 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/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-11-10 01:48:51,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:48:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:48:51,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:48:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 01:48:51,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:48:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 01:48:51,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:48:51,849 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/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-11-10 01:48:51,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:48:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:48:51,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:48:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 01:48:52,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:48:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 01:48:52,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 01:48:52,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13, 13] total 35 [2018-11-10 01:48:52,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-10 01:48:52,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-10 01:48:52,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 01:48:52,852 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand 35 states. [2018-11-10 01:48:54,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:48:54,804 INFO L93 Difference]: Finished difference Result 224 states and 288 transitions. [2018-11-10 01:48:54,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-10 01:48:54,804 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 53 [2018-11-10 01:48:54,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:48:54,806 INFO L225 Difference]: With dead ends: 224 [2018-11-10 01:48:54,806 INFO L226 Difference]: Without dead ends: 159 [2018-11-10 01:48:54,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 179 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=235, Invalid=1571, Unknown=0, NotChecked=0, Total=1806 [2018-11-10 01:48:54,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-10 01:48:54,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 80. [2018-11-10 01:48:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-10 01:48:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-11-10 01:48:54,820 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 53 [2018-11-10 01:48:54,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:48:54,821 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-11-10 01:48:54,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-10 01:48:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-11-10 01:48:54,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 01:48:54,822 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:48:54,822 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:48:54,822 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:48:54,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:48:54,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1519683647, now seen corresponding path program 1 times [2018-11-10 01:48:54,822 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:48:54,823 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:48:54,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:48:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:48:54,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:48:54,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 01:48:54,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:48:54,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:54,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:54,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:54,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-11-10 01:48:55,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 01:48:55,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:48:55,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:55,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:55,072 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 3 case distinctions, treesize of input 20 treesize of output 32 [2018-11-10 01:48:55,076 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 21 treesize of output 20 [2018-11-10 01:48:55,076 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:55,109 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:55,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:55,119 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-10 01:48:55,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 01:48:55,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 01:48:55,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:55,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:55,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:48:55,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:31 [2018-11-10 01:48:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:48:55,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:48:57,753 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 01:48:57,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:57,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:57,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:1 [2018-11-10 01:48:57,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-10 01:48:57,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 01:48:57,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:57,934 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 20 treesize of output 16 [2018-11-10 01:48:57,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-10 01:48:57,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:57,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:57,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-10 01:48:57,944 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 13 treesize of output 4 [2018-11-10 01:48:57,945 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:57,948 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:57,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-11-10 01:48:57,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 01:48:57,952 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:57,957 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:57,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 01:48:57,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:48:57,995 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:32, output treesize:9 [2018-11-10 01:48:58,031 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 01:48:58,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:48:58,033 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:48:58,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:48:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:48:58,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:48:58,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 01:48:58,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:48:58,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-11-10 01:48:58,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 01:48:58,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:48:58,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,163 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 3 case distinctions, treesize of input 20 treesize of output 32 [2018-11-10 01:48:58,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2018-11-10 01:48:58,169 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-11-10 01:48:58,210 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,234 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-10 01:48:58,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 01:48:58,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 01:48:58,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:48:58,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:31 [2018-11-10 01:48:58,302 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:48:58,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:48:58,593 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 01:48:58,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:1 [2018-11-10 01:48:58,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-10 01:48:58,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 01:48:58,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,723 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 20 treesize of output 16 [2018-11-10 01:48:58,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-10 01:48:58,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,730 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-11-10 01:48:58,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 01:48:58,734 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,739 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-10 01:48:58,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-10 01:48:58,744 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,748 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:48:58,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 01:48:58,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:48:58,794 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:32, output treesize:9 [2018-11-10 01:48:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 01:48:58,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 01:48:58,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 16, 13] total 26 [2018-11-10 01:48:58,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-10 01:48:58,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-10 01:48:58,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=570, Unknown=1, NotChecked=0, Total=650 [2018-11-10 01:48:58,819 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 26 states. [2018-11-10 01:49:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:07,745 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2018-11-10 01:49:07,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 01:49:07,746 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2018-11-10 01:49:07,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:07,747 INFO L225 Difference]: With dead ends: 121 [2018-11-10 01:49:07,747 INFO L226 Difference]: Without dead ends: 115 [2018-11-10 01:49:07,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 188 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=163, Invalid=1026, Unknown=1, NotChecked=0, Total=1190 [2018-11-10 01:49:07,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-10 01:49:07,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 82. [2018-11-10 01:49:07,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 01:49:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-11-10 01:49:07,756 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 54 [2018-11-10 01:49:07,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:07,756 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-11-10 01:49:07,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-10 01:49:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-11-10 01:49:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 01:49:07,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:07,757 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:07,757 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:07,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:07,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1186417063, now seen corresponding path program 2 times [2018-11-10 01:49:07,758 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:49:07,758 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:49:07,771 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 01:49:07,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 01:49:07,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:49:07,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 01:49:07,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:49:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 01:49:08,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:49:08,203 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:49:08,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 01:49:08,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 01:49:08,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:49:08,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:08,248 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 01:49:08,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:49:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 01:49:08,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 01:49:08,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13, 15] total 20 [2018-11-10 01:49:08,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 01:49:08,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 01:49:08,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-11-10 01:49:08,381 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 20 states. [2018-11-10 01:49:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:08,998 INFO L93 Difference]: Finished difference Result 160 states and 206 transitions. [2018-11-10 01:49:08,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 01:49:08,999 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2018-11-10 01:49:08,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:09,000 INFO L225 Difference]: With dead ends: 160 [2018-11-10 01:49:09,000 INFO L226 Difference]: Without dead ends: 157 [2018-11-10 01:49:09,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 199 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2018-11-10 01:49:09,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-10 01:49:09,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 124. [2018-11-10 01:49:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-10 01:49:09,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 154 transitions. [2018-11-10 01:49:09,020 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 154 transitions. Word has length 56 [2018-11-10 01:49:09,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:09,020 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 154 transitions. [2018-11-10 01:49:09,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 01:49:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 154 transitions. [2018-11-10 01:49:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 01:49:09,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:09,022 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:09,022 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:09,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:09,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1000982003, now seen corresponding path program 3 times [2018-11-10 01:49:09,023 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:49:09,023 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:49:09,038 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-10 01:49:09,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 01:49:09,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:49:09,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:09,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 01:49:09,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:09,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:09,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 01:49:09,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 01:49:09,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:09,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:09,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:09,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 01:49:09,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:09,399 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:09,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:09,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:09,411 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-11-10 01:49:09,463 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:09,474 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 19 treesize of output 20 [2018-11-10 01:49:09,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:09,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:09,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:09,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:09,508 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 19 treesize of output 24 [2018-11-10 01:49:09,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:09,511 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:09,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:09,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:09,533 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:58 [2018-11-10 01:49:09,630 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:09,631 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:09,633 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:09,634 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:09,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-10 01:49:09,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:09,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:09,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:52 [2018-11-10 01:49:09,716 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:09,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-11-10 01:49:09,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:09,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:09,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:09,780 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:09,784 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:09,786 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:09,788 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 42 treesize of output 72 [2018-11-10 01:49:09,793 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 31 treesize of output 28 [2018-11-10 01:49:09,793 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:09,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:09,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:09,829 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:71, output treesize:60 [2018-11-10 01:49:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:10,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:49:11,037 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-10 01:49:12,463 WARN L179 SmtUtils]: Spent 632.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-11-10 01:49:12,809 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-10 01:49:13,250 WARN L179 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-11-10 01:49:13,678 WARN L179 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-11-10 01:49:13,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 626 treesize of output 507 [2018-11-10 01:49:13,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 01:49:13,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:13,784 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:13,811 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 488 treesize of output 436 [2018-11-10 01:49:13,946 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 36 [2018-11-10 01:49:13,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 01:49:13,951 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:13,990 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:13,994 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 332 treesize of output 327 [2018-11-10 01:49:14,000 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 318 treesize of output 308 [2018-11-10 01:49:14,001 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:14,025 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:14,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:14,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:14,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 308 treesize of output 157 [2018-11-10 01:49:14,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 9 treesize of output 8 [2018-11-10 01:49:14,298 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:14,319 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:14,328 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 156 treesize of output 88 [2018-11-10 01:49:14,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 01:49:14,408 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:14,437 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:14,437 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:14,438 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:14,456 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:14,464 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:14,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 87 [2018-11-10 01:49:14,471 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 29 treesize of output 23 [2018-11-10 01:49:14,471 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:14,495 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:14,496 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:14,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-11-10 01:49:14,509 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-11-10 01:49:14,510 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 01:49:14,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 01:49:14,530 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:14,534 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:14,540 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:14,545 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:14,550 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:14,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:49:14,559 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:1253, output treesize:24 [2018-11-10 01:49:14,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:49:14,633 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:49:14,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 01:49:14,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 01:49:14,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:49:14,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:14,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 01:49:14,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:14,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:14,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 01:49:14,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 01:49:14,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:14,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:14,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:14,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 01:49:14,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:14,868 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:14,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:14,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:14,878 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-11-10 01:49:15,047 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:15,058 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 19 treesize of output 20 [2018-11-10 01:49:15,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:15,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:15,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:15,092 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:15,100 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 19 treesize of output 24 [2018-11-10 01:49:15,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:15,103 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:15,112 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:15,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:15,129 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:52 [2018-11-10 01:49:15,367 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:15,368 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:15,369 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:15,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 20 treesize of output 21 [2018-11-10 01:49:15,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:15,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:15,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:51 [2018-11-10 01:49:15,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 59 [2018-11-10 01:49:15,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:15,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:15,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:15,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 62 [2018-11-10 01:49:15,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:15,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:15,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:15,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:15,614 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:73, output treesize:107 [2018-11-10 01:49:18,169 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_length_#in~head.base|) |c_sll_length_#in~head.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_sll_length_#in~head.base|) |c_sll_length_#in~head.offset|))) (or (and (not (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) (_ bv0 32))) (exists ((|v_main_~#s~0.offset_BEFORE_CALL_13| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_11|) |v_main_~#s~0.offset_BEFORE_CALL_13|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_11|) |v_main_~#s~0.offset_BEFORE_CALL_13|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) .cse5)) (.cse3 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5))) (and (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3)) (not (= .cse2 .cse4)) (not (= .cse2 |v_main_~#s~0.base_BEFORE_CALL_11|)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.base| .cse2) .cse3)) (not (= .cse4 |v_main_~#s~0.base_BEFORE_CALL_11|))))))) (and (exists ((v_prenex_12 (_ BitVec 32)) (v_prenex_13 (_ BitVec 32))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| v_prenex_13) v_prenex_12)) (.cse9 (select (select |c_#memory_$Pointer$.offset| v_prenex_13) v_prenex_12))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse6) .cse9)) (.cse8 (select (select |c_#memory_$Pointer$.offset| .cse6) .cse9))) (and (not (= .cse6 v_prenex_13)) (not (= .cse7 v_prenex_13)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.base| .cse7) .cse8)) (not (= .cse7 .cse6)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8)))))) (not (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) (_ bv0 32)))))) is different from true [2018-11-10 01:49:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:18,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:49:19,803 WARN L179 SmtUtils]: Spent 519.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-11-10 01:49:19,999 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-10 01:49:20,322 WARN L179 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-10 01:49:20,634 WARN L179 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-10 01:49:20,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 176 [2018-11-10 01:49:20,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 01:49:20,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:20,747 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:20,766 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 160 treesize of output 156 [2018-11-10 01:49:20,921 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2018-11-10 01:49:20,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 01:49:20,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:21,036 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:21,039 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 25 treesize of output 24 [2018-11-10 01:49:21,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 01:49:21,042 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:21,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 01:49:21,063 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:21,073 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:21,083 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:21,089 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 144 treesize of output 141 [2018-11-10 01:49:21,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 01:49:21,097 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:21,127 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 132 treesize of output 123 [2018-11-10 01:49:21,128 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:21,134 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:21,185 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 01:49:21,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 01:49:21,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 144 [2018-11-10 01:49:21,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 01:49:21,843 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:21,896 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:21,907 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 128 treesize of output 108 [2018-11-10 01:49:22,011 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2018-11-10 01:49:22,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 01:49:22,017 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:22,087 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:22,116 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:22,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 140 [2018-11-10 01:49:22,190 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 01:49:22,190 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:22,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:22,452 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:22,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2018-11-10 01:49:22,453 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:22,700 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:22,701 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 92 treesize of output 89 [2018-11-10 01:49:22,701 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,055 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:23,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84 [2018-11-10 01:49:23,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 01:49:23,061 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 01:49:23,081 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,094 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,213 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:23,215 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 25 treesize of output 24 [2018-11-10 01:49:23,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 01:49:23,218 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 01:49:23,229 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,234 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,348 INFO L267 ElimStorePlain]: Start of recursive call 16: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:23,391 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:23,432 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:23,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 64 [2018-11-10 01:49:23,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 01:49:23,766 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,786 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:23,796 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 41 treesize of output 37 [2018-11-10 01:49:23,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 01:49:23,838 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,852 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:23,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-11-10 01:49:23,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 01:49:23,857 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-10 01:49:23,867 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,869 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,871 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,881 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 92 [2018-11-10 01:49:24,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 01:49:24,024 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,042 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:24,048 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 68 treesize of output 48 [2018-11-10 01:49:24,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 01:49:24,094 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,108 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:24,111 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 17 treesize of output 16 [2018-11-10 01:49:24,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 01:49:24,113 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,120 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 6 treesize of output 1 [2018-11-10 01:49:24,121 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,122 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,124 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,133 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 87 [2018-11-10 01:49:24,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 01:49:24,149 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,182 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:24,190 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 68 treesize of output 48 [2018-11-10 01:49:24,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 01:49:24,272 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,308 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:24,310 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:24,315 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 0 case distinctions, treesize of input 37 treesize of output 44 [2018-11-10 01:49:24,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-11-10 01:49:24,319 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,335 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:24,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-11-10 01:49:24,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-11-10 01:49:24,341 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-10 01:49:24,349 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,350 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,356 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,362 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,374 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 143 [2018-11-10 01:49:24,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 01:49:24,392 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,432 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:24,447 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 75 [2018-11-10 01:49:24,566 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2018-11-10 01:49:24,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-10 01:49:24,572 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,608 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:24,614 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:24,615 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 0 case distinctions, treesize of input 40 treesize of output 47 [2018-11-10 01:49:24,620 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:24,620 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 21 treesize of output 16 [2018-11-10 01:49:24,620 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,638 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:24,641 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 28 treesize of output 23 [2018-11-10 01:49:24,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-11-10 01:49:24,644 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-10 01:49:24,653 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,655 INFO L267 ElimStorePlain]: Start of recursive call 55: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,663 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,664 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 01:49:24,664 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,668 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:24,669 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:24,669 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:24,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-11-10 01:49:24,721 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 56 [2018-11-10 01:49:24,722 INFO L267 ElimStorePlain]: Start of recursive call 60: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 01:49:24,759 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:24,761 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 36 treesize of output 29 [2018-11-10 01:49:24,764 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 8 treesize of output 1 [2018-11-10 01:49:24,764 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 12 [2018-11-10 01:49:24,782 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:24,787 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,792 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,795 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:24,796 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:24,798 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:24,811 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:24,812 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 0 case distinctions, treesize of input 55 treesize of output 59 [2018-11-10 01:49:24,817 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:24,818 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:24,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-11-10 01:49:24,819 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,843 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:49:24,845 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 28 treesize of output 23 [2018-11-10 01:49:24,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-11-10 01:49:24,848 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2018-11-10 01:49:24,857 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,860 INFO L267 ElimStorePlain]: Start of recursive call 66: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,867 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:24,892 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:24,913 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:24,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-10 01:49:24,980 INFO L202 ElimStorePlain]: Needed 68 recursive calls to eliminate 14 variables, input treesize:399, output treesize:71 [2018-11-10 01:49:25,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:49:25,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2018-11-10 01:49:25,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-10 01:49:25,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-10 01:49:25,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2249, Unknown=9, NotChecked=96, Total=2550 [2018-11-10 01:49:25,101 INFO L87 Difference]: Start difference. First operand 124 states and 154 transitions. Second operand 34 states. [2018-11-10 01:49:27,541 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2018-11-10 01:49:28,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:28,803 INFO L93 Difference]: Finished difference Result 198 states and 246 transitions. [2018-11-10 01:49:28,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 01:49:28,804 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 58 [2018-11-10 01:49:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:49:28,805 INFO L225 Difference]: With dead ends: 198 [2018-11-10 01:49:28,805 INFO L226 Difference]: Without dead ends: 183 [2018-11-10 01:49:28,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 113 SyntacticMatches, 11 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=294, Invalid=3123, Unknown=9, NotChecked=114, Total=3540 [2018-11-10 01:49:28,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-10 01:49:28,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 167. [2018-11-10 01:49:28,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-10 01:49:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 208 transitions. [2018-11-10 01:49:28,832 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 208 transitions. Word has length 58 [2018-11-10 01:49:28,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:49:28,832 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 208 transitions. [2018-11-10 01:49:28,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-10 01:49:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 208 transitions. [2018-11-10 01:49:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 01:49:28,833 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:49:28,833 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:28,834 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:49:28,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:28,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1401907329, now seen corresponding path program 2 times [2018-11-10 01:49:28,834 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:49:28,834 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:49:28,852 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 01:49:28,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 01:49:28,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 01:49:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:29,149 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 01:49:29,161 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,162 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,163 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,163 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,165 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,165 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,165 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,166 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,166 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,166 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,167 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,167 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,167 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,167 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,168 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,168 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,168 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,168 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,169 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,169 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,169 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,169 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,170 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,170 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,170 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,170 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,171 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,171 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,180 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,180 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,180 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,180 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,181 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,181 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,181 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,182 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,182 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,182 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,182 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,183 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,183 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,188 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,189 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,190 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,190 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,190 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,190 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,191 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:49:29 BoogieIcfgContainer [2018-11-10 01:49:29,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 01:49:29,213 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 01:49:29,213 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 01:49:29,213 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 01:49:29,214 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:48:32" (3/4) ... [2018-11-10 01:49:29,215 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 01:49:29,217 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,217 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,217 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,217 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,217 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,217 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,218 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,218 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,218 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,218 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,219 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,219 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,220 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,220 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,220 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,220 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,220 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,220 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,221 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,221 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,221 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,221 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,221 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,221 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,222 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,222 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,222 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,222 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,223 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,223 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,223 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,223 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,224 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,224 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,224 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,225 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,225 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,225 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,225 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,225 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,225 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,226 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,227 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,227 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,227 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,228 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,228 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,228 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 01:49:29,263 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_67b1d0fe-9772-4cb4-9f13-03d9f36983fe/bin-2019/utaipan/witness.graphml [2018-11-10 01:49:29,263 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 01:49:29,264 INFO L168 Benchmark]: Toolchain (without parser) took 57962.20 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 155.8 MB. Max. memory is 11.5 GB. [2018-11-10 01:49:29,264 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:49:29,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.62 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 917.0 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2018-11-10 01:49:29,265 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 917.0 MB in the beginning and 1.1 GB in the end (delta: -222.9 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-11-10 01:49:29,265 INFO L168 Benchmark]: Boogie Preprocessor took 26.95 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:49:29,265 INFO L168 Benchmark]: RCFGBuilder took 359.40 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: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2018-11-10 01:49:29,265 INFO L168 Benchmark]: TraceAbstraction took 57088.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.2 MB). Peak memory consumption was 149.4 MB. Max. memory is 11.5 GB. [2018-11-10 01:49:29,265 INFO L168 Benchmark]: Witness Printer took 50.08 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. [2018-11-10 01:49:29,267 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.12 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 358.62 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 917.0 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 917.0 MB in the beginning and 1.1 GB in the end (delta: -222.9 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.95 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 359.40 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: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 57088.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.2 MB). Peak memory consumption was 149.4 MB. Max. memory is 11.5 GB. * Witness Printer took 50.08 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 630]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L616] CALL, EXPR _get_nondet_int(2, 5) VAL [\old(from)=2, \old(until)=5] [L609] int len = from; VAL [\old(from)=2, \old(until)=5, from=2, len=2, until=5] [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] RET return len; VAL [\old(from)=2, \old(until)=5, \result=2, from=2, len=2, until=5] [L616] EXPR _get_nondet_int(2, 5) [L616] const int len = _get_nondet_int(2, 5); [L617] CALL SLL s = sll_create(len); [L617] RET SLL s = sll_create(len); [L617] CALL, EXPR sll_create(len) [L564] SLL head = ((void *)0); [L565] EXPR len-- [L565] COND TRUE len-- > 0 [L566] EXPR, FCALL malloc(sizeof(struct node)) [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] CALL new_head->next = head [L570] RET new_head->next = head [L571] head = new_head [L565] EXPR len-- [L565] COND TRUE len-- > 0 [L566] EXPR, FCALL malloc(sizeof(struct node)) [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] CALL new_head->next = head [L570] RET new_head->next = head [L571] head = new_head [L565] EXPR len-- [L565] COND FALSE !(len-- > 0) [L573] RET return head; [L617] EXPR sll_create(len) [L617] CALL SLL s = sll_create(len); [L617] RET SLL s = sll_create(len); [L618] CALL, EXPR _get_nondet_int(0, len - 1) VAL [\old(from)=0, \old(until)=1] [L609] int len = from; VAL [\old(from)=0, \old(until)=1, from=0, len=0, until=1] [L610] COND TRUE len < until && __VERIFIER_nondet_int() [L611] len++ VAL [\old(from)=0, \old(until)=1, from=0, len=1, until=1] [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] RET return len; VAL [\old(from)=0, \old(until)=1, \result=1, from=0, len=1, until=1] [L618] EXPR _get_nondet_int(0, len - 1) [L618] const int k = _get_nondet_int(0, len - 1); [L619] int i = 0; [L620] COND FALSE !(i < k && __VERIFIER_nondet_int()) [L625] CALL, EXPR \read(s) [L625] RET, EXPR \read(s) [L625] CALL, EXPR sll_length(s) [L576] int len = 0; [L577] COND TRUE \read(head) [L578] len++ [L579] CALL, EXPR head->next [L579] RET, EXPR head->next [L579] head = head->next [L577] COND TRUE \read(head) [L578] len++ [L579] CALL, EXPR head->next [L579] RET, EXPR head->next [L579] head = head->next [L577] COND FALSE !(\read(head)) [L581] RET return len; [L625] EXPR sll_length(s) [L625] COND TRUE k + len != sll_length(s) [L630] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 70 locations, 1 error locations. UNSAFE Result, 57.0s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 32.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 524 SDtfs, 468 SDslu, 5887 SDs, 0 SdLazy, 4317 SolverSat, 226 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 27.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1291 GetRequests, 1026 SyntacticMatches, 30 SemanticMatches, 235 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2241 ImplicationChecksByTransitivity, 15.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 314 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 22.9s InterpolantComputationTime, 760 NumberOfCodeBlocks, 760 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1140 ConstructedInterpolants, 87 QuantifiedInterpolants, 646275 SizeOfPredicates, 232 NumberOfNonLiveVariables, 2200 ConjunctsInSsa, 366 ConjunctsInUnsatCore, 23 InterpolantComputations, 3 PerfectInterpolantSequences, 213/388 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...