./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/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 fabf658906da38258bbb10e77b5550f740cea929 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/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 fabf658906da38258bbb10e77b5550f740cea929 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 07:17:33,550 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 07:17:33,551 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 07:17:33,557 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 07:17:33,557 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 07:17:33,558 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 07:17:33,559 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 07:17:33,560 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 07:17:33,561 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 07:17:33,561 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 07:17:33,562 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 07:17:33,562 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 07:17:33,563 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 07:17:33,564 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 07:17:33,564 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 07:17:33,565 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 07:17:33,566 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 07:17:33,567 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 07:17:33,568 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 07:17:33,569 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 07:17:33,570 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 07:17:33,571 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 07:17:33,572 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 07:17:33,572 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 07:17:33,572 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 07:17:33,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 07:17:33,573 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 07:17:33,574 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 07:17:33,574 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 07:17:33,575 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 07:17:33,575 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 07:17:33,576 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 07:17:33,576 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 07:17:33,576 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 07:17:33,577 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 07:17:33,577 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 07:17:33,577 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 07:17:33,586 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 07:17:33,586 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 07:17:33,587 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 07:17:33,587 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 07:17:33,587 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 07:17:33,587 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 07:17:33,587 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 07:17:33,587 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 07:17:33,587 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 07:17:33,588 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 07:17:33,588 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 07:17:33,588 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 07:17:33,588 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 07:17:33,589 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 07:17:33,589 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 07:17:33,589 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 07:17:33,589 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 07:17:33,589 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 07:17:33,589 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 07:17:33,589 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 07:17:33,589 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 07:17:33,590 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 07:17:33,590 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 07:17:33,590 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 07:17:33,590 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 07:17:33,590 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 07:17:33,590 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 07:17:33,590 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 07:17:33,591 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:17:33,591 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 07:17:33,591 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 07:17:33,591 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 07:17:33,591 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 07:17:33,591 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 07:17:33,591 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 07:17:33,591 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 07:17:33,592 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_616b5908-0987-4ca3-880b-97e25f58c0d5/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 -> fabf658906da38258bbb10e77b5550f740cea929 [2018-12-03 07:17:33,613 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 07:17:33,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 07:17:33,622 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 07:17:33,623 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 07:17:33,623 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 07:17:33,623 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:17:33,658 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/data/86571ff90/d87805b7a8c44a49932c52daf356e123/FLAGbedb9039d [2018-12-03 07:17:34,158 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 07:17:34,158 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:17:34,164 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/data/86571ff90/d87805b7a8c44a49932c52daf356e123/FLAGbedb9039d [2018-12-03 07:17:34,172 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/data/86571ff90/d87805b7a8c44a49932c52daf356e123 [2018-12-03 07:17:34,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 07:17:34,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 07:17:34,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 07:17:34,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 07:17:34,177 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 07:17:34,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:17:34" (1/1) ... [2018-12-03 07:17:34,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c140d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:17:34, skipping insertion in model container [2018-12-03 07:17:34,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:17:34" (1/1) ... [2018-12-03 07:17:34,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 07:17:34,202 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 07:17:34,347 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:17:34,391 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 07:17:34,416 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:17:34,437 INFO L195 MainTranslator]: Completed translation [2018-12-03 07:17:34,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:17:34 WrapperNode [2018-12-03 07:17:34,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 07:17:34,437 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 07:17:34,437 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 07:17:34,438 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 07:17:34,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:17:34" (1/1) ... [2018-12-03 07:17:34,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:17:34" (1/1) ... [2018-12-03 07:17:34,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 07:17:34,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 07:17:34,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 07:17:34,455 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 07:17:34,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:17:34" (1/1) ... [2018-12-03 07:17:34,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:17:34" (1/1) ... [2018-12-03 07:17:34,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:17:34" (1/1) ... [2018-12-03 07:17:34,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:17:34" (1/1) ... [2018-12-03 07:17:34,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:17:34" (1/1) ... [2018-12-03 07:17:34,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:17:34" (1/1) ... [2018-12-03 07:17:34,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:17:34" (1/1) ... [2018-12-03 07:17:34,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 07:17:34,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 07:17:34,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 07:17:34,474 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 07:17:34,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:17:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/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-12-03 07:17:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-03 07:17:34,505 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-03 07:17:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-03 07:17:34,505 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-03 07:17:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 07:17:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 07:17:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2018-12-03 07:17:34,505 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2018-12-03 07:17:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 07:17:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2018-12-03 07:17:34,506 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2018-12-03 07:17:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 07:17:34,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 07:17:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 07:17:34,506 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 07:17:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 07:17:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 07:17:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 07:17:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-03 07:17:34,506 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-03 07:17:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 07:17:34,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 07:17:34,677 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 07:17:34,678 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-03 07:17:34,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:17:34 BoogieIcfgContainer [2018-12-03 07:17:34,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 07:17:34,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 07:17:34,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 07:17:34,682 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 07:17:34,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 07:17:34" (1/3) ... [2018-12-03 07:17:34,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7ff60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:17:34, skipping insertion in model container [2018-12-03 07:17:34,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:17:34" (2/3) ... [2018-12-03 07:17:34,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7ff60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:17:34, skipping insertion in model container [2018-12-03 07:17:34,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:17:34" (3/3) ... [2018-12-03 07:17:34,684 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:17:34,690 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 07:17:34,695 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 07:17:34,705 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 07:17:34,723 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 07:17:34,723 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 07:17:34,723 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 07:17:34,723 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 07:17:34,723 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 07:17:34,723 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 07:17:34,723 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 07:17:34,724 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 07:17:34,734 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-12-03 07:17:34,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 07:17:34,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:17:34,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:17:34,742 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:17:34,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:17:34,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2123187409, now seen corresponding path program 1 times [2018-12-03 07:17:34,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:17:34,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:34,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:17:34,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:34,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:17:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:17:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:17:34,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:17:34,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:17:34,870 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:17:34,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:17:34,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:17:34,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:17:34,882 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 5 states. [2018-12-03 07:17:34,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:17:34,923 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2018-12-03 07:17:34,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:17:34,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-03 07:17:34,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:17:34,929 INFO L225 Difference]: With dead ends: 95 [2018-12-03 07:17:34,929 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 07:17:34,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:17:34,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 07:17:34,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-12-03 07:17:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 07:17:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-12-03 07:17:34,954 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2018-12-03 07:17:34,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:17:34,954 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-12-03 07:17:34,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:17:34,954 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-12-03 07:17:34,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 07:17:34,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:17:34,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:17:34,955 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:17:34,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:17:34,955 INFO L82 PathProgramCache]: Analyzing trace with hash -287578872, now seen corresponding path program 1 times [2018-12-03 07:17:34,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:17:34,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:34,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:17:34,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:34,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:17:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:17:34,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:17:34,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:17:34,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:17:34,994 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:17:34,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:17:34,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:17:34,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:17:34,996 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 3 states. [2018-12-03 07:17:35,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:17:35,009 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-12-03 07:17:35,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:17:35,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 07:17:35,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:17:35,010 INFO L225 Difference]: With dead ends: 73 [2018-12-03 07:17:35,010 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 07:17:35,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:17:35,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 07:17:35,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-12-03 07:17:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 07:17:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-03 07:17:35,014 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 30 [2018-12-03 07:17:35,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:17:35,014 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-03 07:17:35,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:17:35,014 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-03 07:17:35,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 07:17:35,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:17:35,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:17:35,015 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:17:35,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:17:35,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1976522614, now seen corresponding path program 1 times [2018-12-03 07:17:35,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:17:35,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:35,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:17:35,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:35,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:17:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:17:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:17:35,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:17:35,056 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:17:35,056 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-03 07:17:35,057 INFO L205 CegarAbsIntRunner]: [15], [22], [28], [29], [30], [32], [38], [47], [55], [57], [60], [70], [87], [88], [94], [101], [103], [109], [111], [116], [118], [122], [123], [127], [128], [131], [132], [137], [138], [139] [2018-12-03 07:17:35,076 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:17:35,077 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:17:35,171 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:17:35,172 INFO L272 AbstractInterpreter]: Visited 14 different actions 19 times. Merged at 4 different actions 4 times. Never widened. Performed 177 root evaluator evaluations with a maximum evaluation depth of 3. Performed 177 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-12-03 07:17:35,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:17:35,177 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:17:35,218 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 78.37% of their original sizes. [2018-12-03 07:17:35,218 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:17:35,252 INFO L418 sIntCurrentIteration]: We unified 29 AI predicates to 29 [2018-12-03 07:17:35,252 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:17:35,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:17:35,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-03 07:17:35,253 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:17:35,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:17:35,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:17:35,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:17:35,253 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 9 states. [2018-12-03 07:17:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:17:35,506 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-12-03 07:17:35,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:17:35,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-12-03 07:17:35,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:17:35,508 INFO L225 Difference]: With dead ends: 73 [2018-12-03 07:17:35,508 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 07:17:35,508 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-03 07:17:35,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 07:17:35,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-12-03 07:17:35,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 07:17:35,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-12-03 07:17:35,515 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 30 [2018-12-03 07:17:35,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:17:35,515 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-12-03 07:17:35,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:17:35,515 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-12-03 07:17:35,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 07:17:35,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:17:35,516 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:17:35,516 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:17:35,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:17:35,517 INFO L82 PathProgramCache]: Analyzing trace with hash -602728307, now seen corresponding path program 1 times [2018-12-03 07:17:35,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:17:35,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:35,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:17:35,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:35,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:17:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:17:35,570 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:17:35,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:17:35,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:17:35,571 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:17:35,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:17:35,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:17:35,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:17:35,572 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 4 states. [2018-12-03 07:17:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:17:35,594 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-12-03 07:17:35,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:17:35,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-03 07:17:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:17:35,595 INFO L225 Difference]: With dead ends: 70 [2018-12-03 07:17:35,595 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 07:17:35,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:17:35,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 07:17:35,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2018-12-03 07:17:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 07:17:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-12-03 07:17:35,602 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 35 [2018-12-03 07:17:35,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:17:35,603 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-12-03 07:17:35,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:17:35,603 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-12-03 07:17:35,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 07:17:35,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:17:35,603 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:17:35,603 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:17:35,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:17:35,604 INFO L82 PathProgramCache]: Analyzing trace with hash -985974537, now seen corresponding path program 1 times [2018-12-03 07:17:35,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:17:35,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:35,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:17:35,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:35,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:17:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:17:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:17:35,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:17:35,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:17:35,648 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-12-03 07:17:35,649 INFO L205 CegarAbsIntRunner]: [0], [7], [13], [14], [15], [22], [28], [29], [30], [32], [38], [40], [43], [47], [55], [57], [60], [70], [87], [88], [94], [101], [103], [109], [111], [114], [116], [118], [122], [123], [127], [128], [129], [130], [131], [132], [137], [138], [139] [2018-12-03 07:17:35,650 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:17:35,650 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:17:35,701 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 07:17:35,701 INFO L272 AbstractInterpreter]: Visited 28 different actions 61 times. Merged at 11 different actions 21 times. Never widened. Performed 559 root evaluator evaluations with a maximum evaluation depth of 4. Performed 559 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 4 different actions. Largest state had 27 variables. [2018-12-03 07:17:35,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:17:35,702 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 07:17:35,746 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 66.67% of their original sizes. [2018-12-03 07:17:35,746 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 07:17:35,912 INFO L418 sIntCurrentIteration]: We unified 42 AI predicates to 42 [2018-12-03 07:17:35,913 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 07:17:35,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:17:35,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [5] total 20 [2018-12-03 07:17:35,913 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:17:35,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 07:17:35,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 07:17:35,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-12-03 07:17:35,914 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 17 states. [2018-12-03 07:17:36,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:17:36,720 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2018-12-03 07:17:36,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 07:17:36,720 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2018-12-03 07:17:36,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:17:36,722 INFO L225 Difference]: With dead ends: 75 [2018-12-03 07:17:36,722 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 07:17:36,723 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-12-03 07:17:36,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 07:17:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-12-03 07:17:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 07:17:36,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-12-03 07:17:36,728 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 43 [2018-12-03 07:17:36,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:17:36,729 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-12-03 07:17:36,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 07:17:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-12-03 07:17:36,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 07:17:36,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:17:36,730 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:17:36,731 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:17:36,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:17:36,731 INFO L82 PathProgramCache]: Analyzing trace with hash 850280592, now seen corresponding path program 1 times [2018-12-03 07:17:36,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:17:36,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:36,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:17:36,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:36,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:17:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:17:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:17:37,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:17:37,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:17:37,328 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-12-03 07:17:37,328 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [22], [28], [29], [30], [32], [38], [40], [43], [47], [55], [57], [60], [70], [87], [88], [94], [101], [103], [109], [111], [114], [116], [118], [122], [123], [127], [128], [129], [130], [131], [132], [137], [138], [139] [2018-12-03 07:17:37,330 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:17:37,330 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:17:37,384 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:17:37,384 INFO L272 AbstractInterpreter]: Visited 40 different actions 120 times. Merged at 23 different actions 46 times. Never widened. Performed 982 root evaluator evaluations with a maximum evaluation depth of 4. Performed 982 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 12 fixpoints after 7 different actions. Largest state had 27 variables. [2018-12-03 07:17:37,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:17:37,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:17:37,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:17:37,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/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-12-03 07:17:37,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:17:37,395 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:17:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:17:37,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:17:37,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:17:37,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:37,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:37,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 07:17:37,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:17:37,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:17:37,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-03 07:17:37,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:37,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:37,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-03 07:17:37,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-03 07:17:37,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-03 07:17:37,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:17:37,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:17:37,518 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:37,522 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:37,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:37,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:37,530 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-12-03 07:17:37,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-12-03 07:17:37,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-03 07:17:37,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:37,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:37,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:17:37,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-03 07:17:37,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 07:17:37,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 07:17:37,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:37,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:37,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:37,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-03 07:17:37,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-12-03 07:17:37,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:17:37,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:17:37,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-12-03 07:17:37,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:37,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:37,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:17:37,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:45 [2018-12-03 07:17:38,486 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int) (dll_update_at_~data Int)) (= |c_#memory_int| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) (+ |c_dll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) dll_update_at_~head.offset dll_update_at_~data))))) is different from true [2018-12-03 07:17:38,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-12-03 07:17:38,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:17:38,498 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:17:38,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-12-03 07:17:38,501 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:17:38,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-03 07:17:38,507 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:38,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:17:38,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-03 07:17:38,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 07:17:38,521 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:38,524 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:38,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:38,530 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:68, output treesize:17 [2018-12-03 07:17:38,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-12-03 07:17:38,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-03 07:17:38,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:38,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-03 07:17:38,956 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:38,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:38,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:38,961 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:10 [2018-12-03 07:17:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-03 07:17:38,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:17:39,311 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 07:17:39,451 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 07:17:39,455 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 07:17:41,951 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-12-03 07:17:41,954 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 07:17:41,957 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 07:17:44,392 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 70 [2018-12-03 07:17:44,397 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 07:17:46,144 WARN L180 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 67 [2018-12-03 07:17:46,185 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:17:46,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:17:46,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-12-03 07:17:46,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-12-03 07:17:46,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-12-03 07:17:46,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-03 07:17:46,226 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,229 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-03 07:17:46,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-12-03 07:17:46,232 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,233 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-03 07:17:46,271 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:17:46,273 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:17:46,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-12-03 07:17:46,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-12-03 07:17:46,301 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-12-03 07:17:46,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-03 07:17:46,313 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,315 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-03 07:17:46,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-12-03 07:17:46,318 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,319 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,328 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-03 07:17:46,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-03 07:17:46,349 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:121, output treesize:65 [2018-12-03 07:17:46,650 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-12-03 07:17:46,654 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:17:46,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:17:46,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-12-03 07:17:46,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-12-03 07:17:46,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-12-03 07:17:46,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-03 07:17:46,717 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,720 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2018-12-03 07:17:46,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-12-03 07:17:46,728 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-12-03 07:17:46,741 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-03 07:17:46,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-12-03 07:17:46,750 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,754 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:17:46,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-12-03 07:17:46,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-12-03 07:17:46,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-12-03 07:17:46,860 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2018-12-03 07:17:46,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-12-03 07:17:46,881 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-03 07:17:46,889 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-12-03 07:17:46,900 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-12-03 07:17:46,904 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:17:46,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-12-03 07:17:46,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-03 07:17:46,908 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,911 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:46,925 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-12-03 07:17:47,024 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:47,027 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:47,028 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:47,032 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:47,033 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:17:47,037 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:17:47,038 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:17:47,044 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:17:47,045 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:17:47,050 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:17:47,050 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:47,054 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:47,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 11 xjuncts. [2018-12-03 07:17:47,121 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 8 variables, input treesize:149, output treesize:300 [2018-12-03 07:17:47,121 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2018-12-03 07:17:47,643 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:47,643 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:53, output treesize:4 [2018-12-03 07:17:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:17:47,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:17:47,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 26] total 73 [2018-12-03 07:17:47,779 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:17:47,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 07:17:47,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 07:17:47,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=4857, Unknown=3, NotChecked=140, Total=5256 [2018-12-03 07:17:47,781 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 52 states. [2018-12-03 07:17:53,935 WARN L180 SmtUtils]: Spent 942.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2018-12-03 07:17:58,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:17:58,113 INFO L93 Difference]: Finished difference Result 169 states and 219 transitions. [2018-12-03 07:17:58,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 07:17:58,113 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-03 07:17:58,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:17:58,114 INFO L225 Difference]: With dead ends: 169 [2018-12-03 07:17:58,114 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 07:17:58,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 116 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3449 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=891, Invalid=12665, Unknown=20, NotChecked=230, Total=13806 [2018-12-03 07:17:58,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 07:17:58,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 79. [2018-12-03 07:17:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 07:17:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2018-12-03 07:17:58,130 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 52 [2018-12-03 07:17:58,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:17:58,130 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2018-12-03 07:17:58,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 07:17:58,131 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2018-12-03 07:17:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 07:17:58,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:17:58,132 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:17:58,132 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:17:58,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:17:58,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1372027452, now seen corresponding path program 1 times [2018-12-03 07:17:58,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:17:58,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:58,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:17:58,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:58,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:17:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:17:58,176 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 07:17:58,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:17:58,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:17:58,176 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-12-03 07:17:58,177 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [22], [24], [28], [29], [30], [32], [38], [40], [43], [47], [55], [57], [60], [70], [87], [88], [94], [101], [103], [109], [111], [114], [116], [118], [122], [123], [127], [128], [129], [130], [131], [132], [137], [138], [139] [2018-12-03 07:17:58,178 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:17:58,178 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:17:58,234 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:17:58,234 INFO L272 AbstractInterpreter]: Visited 41 different actions 112 times. Merged at 19 different actions 38 times. Never widened. Performed 878 root evaluator evaluations with a maximum evaluation depth of 4. Performed 878 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 5 different actions. Largest state had 27 variables. [2018-12-03 07:17:58,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:17:58,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:17:58,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:17:58,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:17:58,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:17:58,246 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:17:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:17:58,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:17:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 07:17:58,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:17:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 07:17:58,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 07:17:58,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2018-12-03 07:17:58,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:17:58,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:17:58,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:17:58,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:17:58,330 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 5 states. [2018-12-03 07:17:58,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:17:58,356 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2018-12-03 07:17:58,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:17:58,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-03 07:17:58,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:17:58,357 INFO L225 Difference]: With dead ends: 104 [2018-12-03 07:17:58,357 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 07:17:58,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:17:58,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 07:17:58,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-12-03 07:17:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 07:17:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2018-12-03 07:17:58,367 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 53 [2018-12-03 07:17:58,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:17:58,367 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2018-12-03 07:17:58,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:17:58,367 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2018-12-03 07:17:58,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 07:17:58,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:17:58,368 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:17:58,368 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:17:58,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:17:58,368 INFO L82 PathProgramCache]: Analyzing trace with hash 993490241, now seen corresponding path program 2 times [2018-12-03 07:17:58,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:17:58,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:58,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:17:58,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:58,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:17:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:17:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 07:17:58,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:17:58,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:17:58,407 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 07:17:58,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 07:17:58,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:17:58,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:17:58,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 07:17:58,415 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 07:17:58,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 07:17:58,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:17:58,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:17:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 07:17:58,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:17:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 07:17:58,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:17:58,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-12-03 07:17:58,518 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:17:58,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 07:17:58,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 07:17:58,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:17:58,518 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand 8 states. [2018-12-03 07:17:58,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:17:58,579 INFO L93 Difference]: Finished difference Result 142 states and 171 transitions. [2018-12-03 07:17:58,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:17:58,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-12-03 07:17:58,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:17:58,580 INFO L225 Difference]: With dead ends: 142 [2018-12-03 07:17:58,580 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 07:17:58,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-03 07:17:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 07:17:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2018-12-03 07:17:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 07:17:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2018-12-03 07:17:58,588 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 53 [2018-12-03 07:17:58,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:17:58,588 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2018-12-03 07:17:58,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 07:17:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2018-12-03 07:17:58,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 07:17:58,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:17:58,589 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:17:58,589 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:17:58,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:17:58,590 INFO L82 PathProgramCache]: Analyzing trace with hash -726983891, now seen corresponding path program 3 times [2018-12-03 07:17:58,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:17:58,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:58,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:17:58,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:58,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:17:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:17:58,618 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 07:17:58,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:17:58,618 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:17:58,619 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 07:17:58,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 07:17:58,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:17:58,619 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/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-12-03 07:17:58,625 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 07:17:58,626 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 07:17:58,644 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 07:17:58,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:17:58,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:17:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 07:17:58,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:17:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 07:17:58,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:17:58,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 07:17:58,725 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:17:58,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 07:17:58,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 07:17:58,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:17:58,726 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand 8 states. [2018-12-03 07:17:58,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:17:58,782 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2018-12-03 07:17:58,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:17:58,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-12-03 07:17:58,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:17:58,783 INFO L225 Difference]: With dead ends: 124 [2018-12-03 07:17:58,783 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 07:17:58,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-03 07:17:58,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 07:17:58,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2018-12-03 07:17:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 07:17:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2018-12-03 07:17:58,791 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 53 [2018-12-03 07:17:58,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:17:58,791 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2018-12-03 07:17:58,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 07:17:58,792 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2018-12-03 07:17:58,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 07:17:58,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:17:58,792 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2018-12-03 07:17:58,792 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:17:58,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:17:58,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1090802182, now seen corresponding path program 4 times [2018-12-03 07:17:58,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:17:58,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:58,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:17:58,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:58,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:17:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:17:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-03 07:17:58,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:17:58,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:17:58,828 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 07:17:58,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 07:17:58,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:17:58,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:17:58,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:17:58,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:17:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:17:58,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:17:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-03 07:17:58,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:17:58,967 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 07:17:58,982 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:17:58,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 14 [2018-12-03 07:17:58,983 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:17:58,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:17:58,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:17:58,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-03 07:17:58,983 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 6 states. [2018-12-03 07:17:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:17:59,011 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2018-12-03 07:17:59,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:17:59,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-03 07:17:59,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:17:59,012 INFO L225 Difference]: With dead ends: 114 [2018-12-03 07:17:59,012 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 07:17:59,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-03 07:17:59,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 07:17:59,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 07:17:59,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 07:17:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-12-03 07:17:59,017 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 60 [2018-12-03 07:17:59,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:17:59,017 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-12-03 07:17:59,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:17:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-12-03 07:17:59,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 07:17:59,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:17:59,018 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:17:59,018 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:17:59,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:17:59,018 INFO L82 PathProgramCache]: Analyzing trace with hash -554830821, now seen corresponding path program 1 times [2018-12-03 07:17:59,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:17:59,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:59,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:17:59,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:59,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:17:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:17:59,051 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 07:17:59,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:17:59,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:17:59,051 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-12-03 07:17:59,052 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [22], [28], [29], [30], [32], [38], [40], [43], [47], [55], [57], [60], [62], [64], [70], [87], [88], [94], [101], [103], [109], [111], [114], [116], [118], [122], [123], [127], [128], [129], [130], [131], [132], [137], [138], [139] [2018-12-03 07:17:59,052 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:17:59,053 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:17:59,093 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:17:59,093 INFO L272 AbstractInterpreter]: Visited 42 different actions 104 times. Merged at 18 different actions 35 times. Never widened. Performed 827 root evaluator evaluations with a maximum evaluation depth of 4. Performed 827 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 11 fixpoints after 7 different actions. Largest state had 27 variables. [2018-12-03 07:17:59,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:17:59,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:17:59,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:17:59,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/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-12-03 07:17:59,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:17:59,101 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:17:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:17:59,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:17:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 07:17:59,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:17:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 07:17:59,203 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:17:59,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 8 [2018-12-03 07:17:59,203 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:17:59,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:17:59,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:17:59,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:17:59,204 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 6 states. [2018-12-03 07:17:59,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:17:59,237 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-12-03 07:17:59,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:17:59,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-03 07:17:59,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:17:59,238 INFO L225 Difference]: With dead ends: 67 [2018-12-03 07:17:59,238 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 07:17:59,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 119 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:17:59,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 07:17:59,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 07:17:59,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 07:17:59,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-12-03 07:17:59,246 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 62 [2018-12-03 07:17:59,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:17:59,246 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-12-03 07:17:59,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:17:59,246 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-12-03 07:17:59,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 07:17:59,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:17:59,247 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:17:59,247 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:17:59,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:17:59,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1980808295, now seen corresponding path program 1 times [2018-12-03 07:17:59,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:17:59,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:59,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:17:59,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:17:59,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:17:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:17:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 07:17:59,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:17:59,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:17:59,756 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-12-03 07:17:59,756 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [22], [24], [28], [29], [30], [32], [38], [40], [43], [47], [55], [57], [60], [62], [64], [70], [87], [88], [94], [101], [103], [109], [111], [114], [116], [118], [122], [123], [127], [128], [129], [130], [131], [132], [137], [138], [139] [2018-12-03 07:17:59,757 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:17:59,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:17:59,810 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:17:59,810 INFO L272 AbstractInterpreter]: Visited 43 different actions 152 times. Merged at 27 different actions 66 times. Never widened. Performed 1118 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1118 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 17 fixpoints after 9 different actions. Largest state had 27 variables. [2018-12-03 07:17:59,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:17:59,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:17:59,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:17:59,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:17:59,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:17:59,818 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:17:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:17:59,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:17:59,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:17:59,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:59,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:59,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 07:17:59,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:17:59,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:17:59,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-03 07:17:59,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:59,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:59,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-03 07:17:59,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-03 07:17:59,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-03 07:17:59,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:17:59,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:17:59,935 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:59,938 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:59,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:59,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:59,944 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-12-03 07:17:59,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-12-03 07:17:59,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-03 07:17:59,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:17:59,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:17:59,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:17:59,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-03 07:18:00,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-03 07:18:00,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-03 07:18:00,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:00,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:00,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:00,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:19 [2018-12-03 07:18:01,319 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int)) (and (<= dll_update_at_~head.offset |c_dll_update_at_#in~head.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset)))))) is different from true [2018-12-03 07:18:01,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-12-03 07:18:01,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:01,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:01,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-12-03 07:18:01,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:01,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:01,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:01,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:38 [2018-12-03 07:18:01,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-12-03 07:18:01,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-03 07:18:01,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:01,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:01,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:01,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-12-03 07:18:01,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:01,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 113 [2018-12-03 07:18:01,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2018-12-03 07:18:01,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:01,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:01,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:01,599 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:18:01,604 INFO L478 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 95 treesize of output 104 [2018-12-03 07:18:01,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 59 [2018-12-03 07:18:01,613 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 07:18:01,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:18:01,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:18:01,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:146, output treesize:100 [2018-12-03 07:18:02,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 70 [2018-12-03 07:18:02,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 55 [2018-12-03 07:18:02,142 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:02,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2018-12-03 07:18:02,164 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:02,182 INFO L478 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 57 treesize of output 42 [2018-12-03 07:18:02,182 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:02,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 07:18:02,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-12-03 07:18:02,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-03 07:18:02,220 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:02,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-12-03 07:18:02,228 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:02,234 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:02,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2018-12-03 07:18:02,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-12-03 07:18:02,243 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:02,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-12-03 07:18:02,258 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:02,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-12-03 07:18:02,274 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:02,288 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 07:18:02,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-03 07:18:02,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-03 07:18:02,316 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:02,319 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:02,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-12-03 07:18:02,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-03 07:18:02,323 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:02,327 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:02,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2018-12-03 07:18:02,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-03 07:18:02,335 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:02,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-03 07:18:02,349 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:02,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-12-03 07:18:02,362 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:02,368 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:02,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:02,379 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 5 variables, input treesize:79, output treesize:7 [2018-12-03 07:18:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-12-03 07:18:02,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:18:02,906 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:02,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:02,917 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:02,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:02,930 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:02,938 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:02,940 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:02,947 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:03,056 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:03,063 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:03,064 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:03,070 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:03,071 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:03,077 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:03,151 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:03,156 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:03,157 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:03,161 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:03,162 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:03,166 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:03,168 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:03,172 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:03,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 81 [2018-12-03 07:18:03,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 5 [2018-12-03 07:18:03,263 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:03,264 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:03,265 INFO L478 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 115 treesize of output 81 [2018-12-03 07:18:03,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 5 [2018-12-03 07:18:03,267 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:03,269 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:03,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 45 [2018-12-03 07:18:03,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 5 [2018-12-03 07:18:03,273 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:03,274 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:03,310 INFO L478 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 135 treesize of output 101 [2018-12-03 07:18:03,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-03 07:18:03,312 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:03,317 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:03,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 75 [2018-12-03 07:18:03,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-03 07:18:03,321 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:03,325 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:03,352 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:03,353 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:03,354 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:03,357 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:03,358 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:03,360 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:03,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-12-03 07:18:03,374 INFO L202 ElimStorePlain]: Needed 39 recursive calls to eliminate 6 variables, input treesize:281, output treesize:218 [2018-12-03 07:18:03,577 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 07:18:03,684 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-12-03 07:18:03,885 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:18:03,887 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:217) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) 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:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) 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:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-12-03 07:18:03,893 INFO L168 Benchmark]: Toolchain (without parser) took 29718.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 262.1 MB). Free memory was 948.1 MB in the beginning and 841.5 MB in the end (delta: 106.6 MB). Peak memory consumption was 368.8 MB. Max. memory is 11.5 GB. [2018-12-03 07:18:03,894 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:18:03,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 75.0 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -110.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-03 07:18:03,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.57 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:18:03,895 INFO L168 Benchmark]: Boogie Preprocessor took 18.45 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:18:03,896 INFO L168 Benchmark]: RCFGBuilder took 204.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-12-03 07:18:03,896 INFO L168 Benchmark]: TraceAbstraction took 29212.75 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.0 GB in the beginning and 841.5 MB in the end (delta: 191.2 MB). Peak memory consumption was 378.3 MB. Max. memory is 11.5 GB. [2018-12-03 07:18:03,901 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 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 261.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 75.0 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -110.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.57 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.45 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 204.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29212.75 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.0 GB in the beginning and 841.5 MB in the end (delta: 191.2 MB). Peak memory consumption was 378.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-03 07:18:05,122 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 07:18:05,123 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 07:18:05,129 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 07:18:05,129 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 07:18:05,129 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 07:18:05,130 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 07:18:05,131 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 07:18:05,132 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 07:18:05,133 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 07:18:05,133 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 07:18:05,134 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 07:18:05,134 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 07:18:05,135 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 07:18:05,136 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 07:18:05,136 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 07:18:05,137 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 07:18:05,138 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 07:18:05,139 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 07:18:05,140 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 07:18:05,141 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 07:18:05,142 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 07:18:05,143 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 07:18:05,144 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 07:18:05,144 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 07:18:05,144 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 07:18:05,145 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 07:18:05,146 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 07:18:05,146 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 07:18:05,147 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 07:18:05,147 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 07:18:05,147 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 07:18:05,148 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 07:18:05,148 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 07:18:05,148 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 07:18:05,149 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 07:18:05,149 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-03 07:18:05,159 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 07:18:05,159 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 07:18:05,160 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 07:18:05,160 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 07:18:05,160 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 07:18:05,161 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 07:18:05,161 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 07:18:05,161 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 07:18:05,161 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 07:18:05,161 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 07:18:05,161 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 07:18:05,162 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 07:18:05,162 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 07:18:05,162 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 07:18:05,162 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 07:18:05,162 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 07:18:05,162 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 07:18:05,162 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-03 07:18:05,162 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-03 07:18:05,163 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 07:18:05,163 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 07:18:05,163 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 07:18:05,163 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 07:18:05,163 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 07:18:05,163 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 07:18:05,163 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 07:18:05,163 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 07:18:05,163 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:18:05,163 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 07:18:05,164 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 07:18:05,164 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 07:18:05,164 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-03 07:18:05,164 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 07:18:05,164 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-03 07:18:05,164 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-03 07:18:05,164 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_616b5908-0987-4ca3-880b-97e25f58c0d5/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 -> fabf658906da38258bbb10e77b5550f740cea929 [2018-12-03 07:18:05,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 07:18:05,197 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 07:18:05,200 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 07:18:05,201 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 07:18:05,201 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 07:18:05,202 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:18:05,241 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/data/1444e529f/dcc6a896c815481f8efb3aa1f426b66f/FLAGd774288ac [2018-12-03 07:18:05,597 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 07:18:05,597 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/sv-benchmarks/c/list-simple/dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:18:05,603 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/data/1444e529f/dcc6a896c815481f8efb3aa1f426b66f/FLAGd774288ac [2018-12-03 07:18:05,612 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/data/1444e529f/dcc6a896c815481f8efb3aa1f426b66f [2018-12-03 07:18:05,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 07:18:05,614 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 07:18:05,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 07:18:05,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 07:18:05,617 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 07:18:05,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:18:05" (1/1) ... [2018-12-03 07:18:05,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49da4dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:18:05, skipping insertion in model container [2018-12-03 07:18:05,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:18:05" (1/1) ... [2018-12-03 07:18:05,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 07:18:05,642 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 07:18:05,805 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:18:05,814 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 07:18:05,843 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:18:05,902 INFO L195 MainTranslator]: Completed translation [2018-12-03 07:18:05,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:18:05 WrapperNode [2018-12-03 07:18:05,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 07:18:05,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 07:18:05,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 07:18:05,903 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 07:18:05,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:18:05" (1/1) ... [2018-12-03 07:18:05,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:18:05" (1/1) ... [2018-12-03 07:18:05,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 07:18:05,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 07:18:05,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 07:18:05,922 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 07:18:05,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:18:05" (1/1) ... [2018-12-03 07:18:05,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:18:05" (1/1) ... [2018-12-03 07:18:05,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:18:05" (1/1) ... [2018-12-03 07:18:05,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:18:05" (1/1) ... [2018-12-03 07:18:05,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:18:05" (1/1) ... [2018-12-03 07:18:05,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:18:05" (1/1) ... [2018-12-03 07:18:05,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:18:05" (1/1) ... [2018-12-03 07:18:05,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 07:18:05,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 07:18:05,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 07:18:05,943 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 07:18:05,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:18:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/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-12-03 07:18:05,974 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-03 07:18:05,974 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-03 07:18:05,974 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-03 07:18:05,974 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-03 07:18:05,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 07:18:05,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-03 07:18:05,974 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2018-12-03 07:18:05,974 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2018-12-03 07:18:05,974 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2018-12-03 07:18:05,975 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2018-12-03 07:18:05,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 07:18:05,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 07:18:05,975 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 07:18:05,975 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 07:18:05,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 07:18:05,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 07:18:05,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 07:18:05,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-03 07:18:05,975 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-03 07:18:05,975 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-03 07:18:05,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 07:18:05,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 07:18:06,235 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 07:18:06,235 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-03 07:18:06,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:18:06 BoogieIcfgContainer [2018-12-03 07:18:06,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 07:18:06,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 07:18:06,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 07:18:06,238 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 07:18:06,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 07:18:05" (1/3) ... [2018-12-03 07:18:06,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc98e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:18:06, skipping insertion in model container [2018-12-03 07:18:06,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:18:05" (2/3) ... [2018-12-03 07:18:06,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc98e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:18:06, skipping insertion in model container [2018-12-03 07:18:06,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:18:06" (3/3) ... [2018-12-03 07:18:06,239 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-03 07:18:06,245 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 07:18:06,249 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 07:18:06,257 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 07:18:06,273 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 07:18:06,274 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 07:18:06,274 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 07:18:06,274 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 07:18:06,274 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 07:18:06,274 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 07:18:06,274 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 07:18:06,274 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 07:18:06,274 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 07:18:06,283 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-12-03 07:18:06,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 07:18:06,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:18:06,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:18:06,289 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:18:06,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:18:06,292 INFO L82 PathProgramCache]: Analyzing trace with hash 493292703, now seen corresponding path program 1 times [2018-12-03 07:18:06,294 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:18:06,294 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:18:06,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:18:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:18:06,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:06,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:18:06,482 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:18:06,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:18:06,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:18:06,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:18:06,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:18:06,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:18:06,496 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 5 states. [2018-12-03 07:18:06,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:18:06,566 INFO L93 Difference]: Finished difference Result 93 states and 124 transitions. [2018-12-03 07:18:06,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:18:06,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-12-03 07:18:06,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:18:06,573 INFO L225 Difference]: With dead ends: 93 [2018-12-03 07:18:06,573 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 07:18:06,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:18:06,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 07:18:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-12-03 07:18:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 07:18:06,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-12-03 07:18:06,600 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 24 [2018-12-03 07:18:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:18:06,600 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-03 07:18:06,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:18:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-12-03 07:18:06,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 07:18:06,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:18:06,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:18:06,601 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:18:06,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:18:06,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1903143933, now seen corresponding path program 1 times [2018-12-03 07:18:06,602 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:18:06,602 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:18:06,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:18:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:18:06,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:06,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:18:06,649 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:18:06,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:18:06,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:18:06,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:18:06,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:18:06,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:18:06,652 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 3 states. [2018-12-03 07:18:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:18:06,924 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-12-03 07:18:06,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:18:06,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-03 07:18:06,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:18:06,925 INFO L225 Difference]: With dead ends: 71 [2018-12-03 07:18:06,925 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 07:18:06,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:18:06,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 07:18:06,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-12-03 07:18:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 07:18:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-12-03 07:18:06,930 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 29 [2018-12-03 07:18:06,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:18:06,930 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-12-03 07:18:06,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:18:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-12-03 07:18:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 07:18:06,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:18:06,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:18:06,931 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:18:06,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:18:06,931 INFO L82 PathProgramCache]: Analyzing trace with hash 397678657, now seen corresponding path program 1 times [2018-12-03 07:18:06,931 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:18:06,932 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:18:06,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:18:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:18:06,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:07,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:18:07,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:18:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:18:07,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:18:07,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/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-12-03 07:18:07,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:18:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:18:07,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 07:18:07,203 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 07:18:07,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 07:18:07,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 6] total 10 [2018-12-03 07:18:07,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 07:18:07,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 07:18:07,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:18:07,218 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 10 states. [2018-12-03 07:18:07,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:18:07,370 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2018-12-03 07:18:07,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:18:07,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-12-03 07:18:07,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:18:07,372 INFO L225 Difference]: With dead ends: 80 [2018-12-03 07:18:07,372 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 07:18:07,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-12-03 07:18:07,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 07:18:07,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2018-12-03 07:18:07,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 07:18:07,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-03 07:18:07,380 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 29 [2018-12-03 07:18:07,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:18:07,381 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-03 07:18:07,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 07:18:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-03 07:18:07,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 07:18:07,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:18:07,382 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:18:07,382 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:18:07,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:18:07,382 INFO L82 PathProgramCache]: Analyzing trace with hash -972894633, now seen corresponding path program 1 times [2018-12-03 07:18:07,382 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:18:07,383 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:18:07,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:18:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:18:07,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:18:07,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:18:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:18:07,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:18:07,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/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-12-03 07:18:07,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:18:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:18:07,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:07,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 07:18:07,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 07:18:07,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:07,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:07,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:07,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-03 07:18:07,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-12-03 07:18:07,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-12-03 07:18:07,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:07,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-03 07:18:07,817 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:07,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-12-03 07:18:07,838 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:07,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:07,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:07,853 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:31, output treesize:7 [2018-12-03 07:18:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:18:07,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:18:08,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-03 07:18:08,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-03 07:18:08,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:08,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:08,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:18:08,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-12-03 07:18:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 07:18:08,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:18:08,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 14, 12] total 26 [2018-12-03 07:18:08,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 07:18:08,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 07:18:08,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-12-03 07:18:08,279 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 26 states. [2018-12-03 07:18:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:18:15,866 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2018-12-03 07:18:15,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 07:18:15,866 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2018-12-03 07:18:15,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:18:15,869 INFO L225 Difference]: With dead ends: 89 [2018-12-03 07:18:15,869 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 07:18:15,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 07:18:15,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 07:18:15,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 47. [2018-12-03 07:18:15,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 07:18:15,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-12-03 07:18:15,878 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 42 [2018-12-03 07:18:15,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:18:15,878 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-12-03 07:18:15,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 07:18:15,878 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-12-03 07:18:15,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 07:18:15,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:18:15,880 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:18:15,880 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:18:15,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:18:15,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1308182797, now seen corresponding path program 2 times [2018-12-03 07:18:15,881 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:18:15,881 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:18:15,895 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-03 07:18:15,970 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:18:15,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:18:15,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 07:18:15,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:18:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 07:18:16,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:18:16,038 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/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-12-03 07:18:16,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-03 07:18:16,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:18:16,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:18:16,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:16,084 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 07:18:16,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:18:16,120 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 07:18:16,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:18:16,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-03 07:18:16,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:18:16,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:18:16,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:18:16,136 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 9 states. [2018-12-03 07:18:16,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:18:16,258 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2018-12-03 07:18:16,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:18:16,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-03 07:18:16,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:18:16,259 INFO L225 Difference]: With dead ends: 92 [2018-12-03 07:18:16,259 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 07:18:16,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-03 07:18:16,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 07:18:16,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2018-12-03 07:18:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 07:18:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-12-03 07:18:16,264 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 50 [2018-12-03 07:18:16,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:18:16,265 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-12-03 07:18:16,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:18:16,265 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-12-03 07:18:16,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 07:18:16,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:18:16,265 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:18:16,265 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:18:16,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:18:16,266 INFO L82 PathProgramCache]: Analyzing trace with hash 504923514, now seen corresponding path program 1 times [2018-12-03 07:18:16,266 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:18:16,266 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:18:16,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:18:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:18:16,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:16,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:18:16,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:16,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:16,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 07:18:16,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:16,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:16,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 07:18:16,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:16,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:16,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-03 07:18:16,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-03 07:18:16,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-03 07:18:16,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:16,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:18:16,453 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:16,459 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:16,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:16,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:16,473 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-12-03 07:18:16,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-12-03 07:18:16,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-03 07:18:16,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:16,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:16,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:16,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-03 07:18:16,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 07:18:16,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 07:18:16,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:16,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:16,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:16,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-03 07:18:16,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-12-03 07:18:16,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:16,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:16,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:17,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-12-03 07:18:17,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:17,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:17,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:17,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:50 [2018-12-03 07:18:18,873 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset (_ BitVec 32)) (dll_update_at_~data (_ BitVec 32))) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) (bvadd |c_dll_update_at_#in~head.offset| (_ bv4 32))))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) dll_update_at_~head.offset dll_update_at_~data))) |c_#memory_int|)) is different from true [2018-12-03 07:18:18,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2018-12-03 07:18:18,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-03 07:18:18,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:18,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:18,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-12-03 07:18:18,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:18,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:18,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-03 07:18:18,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 07:18:18,936 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:18,943 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:18,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:18,954 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:73, output treesize:16 [2018-12-03 07:18:21,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-12-03 07:18:21,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-03 07:18:21,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:21,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-12-03 07:18:21,303 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:21,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:21,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:21,311 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2018-12-03 07:18:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-03 07:18:21,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:18:23,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:18:23,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/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-12-03 07:18:23,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:18:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:18:24,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:24,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:18:24,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:24,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:24,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 07:18:24,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:24,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:24,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 07:18:24,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:24,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:24,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-03 07:18:24,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-03 07:18:24,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-03 07:18:24,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:24,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:18:24,066 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:24,072 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:24,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:24,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:24,087 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-12-03 07:18:24,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-12-03 07:18:24,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-03 07:18:24,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:24,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:24,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:24,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-03 07:18:24,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 07:18:24,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 07:18:24,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:24,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:24,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:24,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-03 07:18:24,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-12-03 07:18:24,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:24,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:24,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:24,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-12-03 07:18:24,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:24,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:24,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:24,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:50 [2018-12-03 07:18:24,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-12-03 07:18:24,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-03 07:18:24,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:24,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:24,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-12-03 07:18:24,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-03 07:18:24,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:24,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:24,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-03 07:18:24,381 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:24,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:24,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:24,400 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:73, output treesize:16 [2018-12-03 07:18:26,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-12-03 07:18:26,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-03 07:18:26,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:26,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-12-03 07:18:26,482 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:26,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:26,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:26,491 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2018-12-03 07:18:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-03 07:18:26,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:18:28,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 07:18:28,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-12-03 07:18:28,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 07:18:28,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 07:18:28,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1027, Unknown=3, NotChecked=64, Total=1190 [2018-12-03 07:18:28,861 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 28 states. [2018-12-03 07:18:44,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:18:44,021 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2018-12-03 07:18:44,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 07:18:44,021 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2018-12-03 07:18:44,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:18:44,022 INFO L225 Difference]: With dead ends: 118 [2018-12-03 07:18:44,022 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 07:18:44,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=282, Invalid=2911, Unknown=3, NotChecked=110, Total=3306 [2018-12-03 07:18:44,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 07:18:44,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2018-12-03 07:18:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 07:18:44,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2018-12-03 07:18:44,040 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 51 [2018-12-03 07:18:44,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:18:44,040 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2018-12-03 07:18:44,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 07:18:44,040 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2018-12-03 07:18:44,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 07:18:44,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:18:44,041 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:18:44,041 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:18:44,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:18:44,041 INFO L82 PathProgramCache]: Analyzing trace with hash -339081988, now seen corresponding path program 1 times [2018-12-03 07:18:44,042 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:18:44,042 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:18:44,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:18:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:18:44,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:44,089 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-03 07:18:44,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:18:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-03 07:18:44,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:18:44,102 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/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-12-03 07:18:44,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:18:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:18:44,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-03 07:18:44,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:18:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-03 07:18:44,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:18:44,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4] total 4 [2018-12-03 07:18:44,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:18:44,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:18:44,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:18:44,158 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand 4 states. [2018-12-03 07:18:44,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:18:44,307 INFO L93 Difference]: Finished difference Result 156 states and 192 transitions. [2018-12-03 07:18:44,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:18:44,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-03 07:18:44,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:18:44,309 INFO L225 Difference]: With dead ends: 156 [2018-12-03 07:18:44,309 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 07:18:44,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 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-12-03 07:18:44,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 07:18:44,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 07:18:44,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 07:18:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2018-12-03 07:18:44,318 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 51 [2018-12-03 07:18:44,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:18:44,318 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2018-12-03 07:18:44,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:18:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2018-12-03 07:18:44,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 07:18:44,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:18:44,318 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:18:44,319 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:18:44,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:18:44,319 INFO L82 PathProgramCache]: Analyzing trace with hash 72098954, now seen corresponding path program 1 times [2018-12-03 07:18:44,319 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:18:44,319 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:18:44,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:18:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:18:44,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 07:18:44,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:18:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 07:18:44,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:18:44,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-12-03 07:18:44,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:18:44,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:18:44,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:18:44,474 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand 7 states. [2018-12-03 07:18:44,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:18:44,532 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2018-12-03 07:18:44,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:18:44,533 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-03 07:18:44,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:18:44,534 INFO L225 Difference]: With dead ends: 115 [2018-12-03 07:18:44,534 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 07:18:44,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:18:44,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 07:18:44,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-12-03 07:18:44,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 07:18:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2018-12-03 07:18:44,544 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 52 [2018-12-03 07:18:44,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:18:44,544 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2018-12-03 07:18:44,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:18:44,544 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2018-12-03 07:18:44,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 07:18:44,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:18:44,545 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:18:44,545 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:18:44,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:18:44,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1373689517, now seen corresponding path program 2 times [2018-12-03 07:18:44,545 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:18:44,545 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:18:44,560 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-03 07:18:44,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:18:44,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:18:44,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 07:18:44,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:18:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 07:18:44,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:18:44,785 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:18:44,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-03 07:18:44,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:18:44,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:18:44,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:44,886 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 07:18:44,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:18:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 07:18:45,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:18:45,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-03 07:18:45,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 07:18:45,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 07:18:45,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-03 07:18:45,223 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 18 states. [2018-12-03 07:18:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:18:46,103 INFO L93 Difference]: Finished difference Result 165 states and 210 transitions. [2018-12-03 07:18:46,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 07:18:46,104 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-12-03 07:18:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:18:46,105 INFO L225 Difference]: With dead ends: 165 [2018-12-03 07:18:46,105 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 07:18:46,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-12-03 07:18:46,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 07:18:46,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 93. [2018-12-03 07:18:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 07:18:46,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2018-12-03 07:18:46,117 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 52 [2018-12-03 07:18:46,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:18:46,117 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2018-12-03 07:18:46,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 07:18:46,117 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2018-12-03 07:18:46,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 07:18:46,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:18:46,118 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:18:46,118 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:18:46,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:18:46,118 INFO L82 PathProgramCache]: Analyzing trace with hash 460074888, now seen corresponding path program 1 times [2018-12-03 07:18:46,118 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:18:46,118 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:18:46,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:18:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:18:46,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 07:18:46,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:18:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 07:18:46,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:18:46,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:18:46,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:18:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:18:46,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 07:18:46,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:18:46,349 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 07:18:46,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:18:46,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-03 07:18:46,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:18:46,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:18:46,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:18:46,365 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand 9 states. [2018-12-03 07:18:46,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:18:46,484 INFO L93 Difference]: Finished difference Result 142 states and 175 transitions. [2018-12-03 07:18:46,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:18:46,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-12-03 07:18:46,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:18:46,485 INFO L225 Difference]: With dead ends: 142 [2018-12-03 07:18:46,486 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 07:18:46,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-03 07:18:46,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 07:18:46,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2018-12-03 07:18:46,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 07:18:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 116 transitions. [2018-12-03 07:18:46,501 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 116 transitions. Word has length 60 [2018-12-03 07:18:46,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:18:46,501 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 116 transitions. [2018-12-03 07:18:46,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:18:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2018-12-03 07:18:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 07:18:46,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:18:46,502 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:18:46,502 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:18:46,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:18:46,503 INFO L82 PathProgramCache]: Analyzing trace with hash -208984649, now seen corresponding path program 3 times [2018-12-03 07:18:46,503 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:18:46,503 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:18:46,524 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-03 07:18:46,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 07:18:46,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:18:46,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-03 07:18:46,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:18:46,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:18:46,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:18:46,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 07:18:55,522 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 07:18:55,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:18:55,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:55,664 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 07:18:55,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:18:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-03 07:18:56,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:18:56,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 9] total 20 [2018-12-03 07:18:56,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 07:18:56,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 07:18:56,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2018-12-03 07:18:56,045 INFO L87 Difference]: Start difference. First operand 97 states and 116 transitions. Second operand 20 states. [2018-12-03 07:18:56,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:18:56,361 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2018-12-03 07:18:56,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 07:18:56,362 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-12-03 07:18:56,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:18:56,362 INFO L225 Difference]: With dead ends: 123 [2018-12-03 07:18:56,362 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 07:18:56,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2018-12-03 07:18:56,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 07:18:56,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 07:18:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 07:18:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-12-03 07:18:56,370 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 60 [2018-12-03 07:18:56,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:18:56,370 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-12-03 07:18:56,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 07:18:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-12-03 07:18:56,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 07:18:56,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:18:56,371 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:18:56,371 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:18:56,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:18:56,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1318208452, now seen corresponding path program 1 times [2018-12-03 07:18:56,372 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:18:56,372 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:18:56,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:18:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:18:56,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:18:56,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:18:56,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:56,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:56,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 07:18:56,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:56,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:56,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 07:18:56,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:56,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:56,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-12-03 07:18:56,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-03 07:18:56,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-03 07:18:56,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:56,599 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:18:56,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 36 [2018-12-03 07:18:56,600 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:56,605 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:56,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:56,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:56,620 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2018-12-03 07:18:56,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-03 07:18:56,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 07:18:56,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:56,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:56,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:56,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-12-03 07:18:56,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-03 07:18:56,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-03 07:18:56,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:56,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:56,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:56,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-03 07:18:56,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-12-03 07:18:56,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:56,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:56,951 INFO L478 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 23 treesize of output 23 [2018-12-03 07:18:56,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:56,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:56,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:56,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:37 [2018-12-03 07:18:57,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-12-03 07:18:57,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-03 07:18:57,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:57,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:57,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:57,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-12-03 07:18:57,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 113 [2018-12-03 07:18:57,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:57,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 119 [2018-12-03 07:18:57,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:57,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 69 [2018-12-03 07:18:57,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:57,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:57,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 131 [2018-12-03 07:18:57,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 69 [2018-12-03 07:18:57,715 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 07:18:57,870 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:18:57,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:18:57,885 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:147, output treesize:57 [2018-12-03 07:18:59,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:59,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:59,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:59,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:59,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:59,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:59,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:59,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:59,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:59,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:59,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:59,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:18:59,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 199 [2018-12-03 07:18:59,995 INFO L478 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 121 treesize of output 106 [2018-12-03 07:18:59,996 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:19:02,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2018-12-03 07:19:02,735 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:04,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 50 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:04,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 80 [2018-12-03 07:19:04,155 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 32 xjuncts. [2018-12-03 07:19:04,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 61 [2018-12-03 07:19:04,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-03 07:19:04,236 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:04,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-03 07:19:04,295 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:04,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-12-03 07:19:04,311 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:04,317 INFO L267 ElimStorePlain]: Start of recursive call 6: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:04,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:04,322 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:158, output treesize:9 [2018-12-03 07:19:04,398 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:19:04,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:19:06,467 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-03 07:19:06,601 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-03 07:19:06,772 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-03 07:19:06,774 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:06,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:06,794 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:06,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:06,816 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:06,838 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:06,839 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:06,858 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:07,123 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:07,141 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:07,142 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:07,163 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:07,164 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:07,185 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:07,186 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:07,205 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:07,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 136 [2018-12-03 07:19:07,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 96 [2018-12-03 07:19:07,547 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-12-03 07:19:07,576 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:07,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 105 [2018-12-03 07:19:07,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-03 07:19:07,583 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:07,597 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:07,600 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:19:07,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 95 [2018-12-03 07:19:07,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-03 07:19:07,608 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:07,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 5 [2018-12-03 07:19:07,632 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:07,642 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:07,643 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-03 07:19:07,643 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:07,644 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-03 07:19:07,644 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:07,649 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:19:07,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 131 [2018-12-03 07:19:07,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-03 07:19:07,661 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:07,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 5 [2018-12-03 07:19:07,689 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:07,693 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:07,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 69 [2018-12-03 07:19:07,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 5 [2018-12-03 07:19:07,699 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:07,711 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:07,712 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-03 07:19:07,712 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:07,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 100 [2018-12-03 07:19:07,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 89 [2018-12-03 07:19:07,751 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:07,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 55 [2018-12-03 07:19:07,816 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:07,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 60 [2018-12-03 07:19:07,891 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-12-03 07:19:07,916 INFO L267 ElimStorePlain]: Start of recursive call 33: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:07,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 105 [2018-12-03 07:19:07,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-03 07:19:07,925 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:07,952 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:07,954 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-03 07:19:07,954 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:08,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-12-03 07:19:08,035 INFO L202 ElimStorePlain]: Needed 39 recursive calls to eliminate 3 variables, input treesize:174, output treesize:117 [2018-12-03 07:19:08,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:19:08,280 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:19:08,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:19:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:19:08,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:19:08,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 07:19:08,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:08,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:08,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 07:19:08,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:19:08,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:19:08,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 07:19:08,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:08,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:08,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-03 07:19:08,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-03 07:19:08,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-03 07:19:08,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:19:08,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-12-03 07:19:08,617 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:08,622 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:08,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:08,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:08,636 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2018-12-03 07:19:08,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-12-03 07:19:08,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-03 07:19:08,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:08,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:08,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:08,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-03 07:19:10,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-12-03 07:19:10,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:19:10,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:19:10,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:19:10,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-12-03 07:19:10,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:10,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:10,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:10,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-12-03 07:19:11,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-12-03 07:19:11,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-03 07:19:11,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:11,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:11,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:11,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:123, output treesize:113 [2018-12-03 07:19:11,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 115 [2018-12-03 07:19:11,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2018-12-03 07:19:11,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:11,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:11,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 89 [2018-12-03 07:19:11,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 27 [2018-12-03 07:19:11,604 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 07:19:11,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:19:11,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:19:11,673 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:165, output treesize:118 [2018-12-03 07:19:14,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2018-12-03 07:19:14,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-12-03 07:19:14,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:14,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:14,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-12-03 07:19:14,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-03 07:19:14,170 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:14,188 INFO L478 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 18 treesize of output 9 [2018-12-03 07:19:14,188 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:14,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:14,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:14,192 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:88, output treesize:9 [2018-12-03 07:19:14,206 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 07:19:14,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:19:16,098 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-03 07:19:16,361 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-03 07:19:16,532 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-03 07:19:16,638 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-03 07:19:16,639 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:16,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:16,663 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:16,688 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:16,689 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:16,707 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:16,707 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:16,726 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:16,889 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:16,904 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:16,904 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:16,920 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:16,920 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:16,939 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:16,939 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:16,964 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:17,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:19:17,156 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 07:19:17,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 97 [2018-12-03 07:19:17,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:19:17,171 INFO L478 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 87 treesize of output 76 [2018-12-03 07:19:17,171 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:17,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 69 [2018-12-03 07:19:17,198 INFO L478 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 59 treesize of output 43 [2018-12-03 07:19:17,199 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:17,209 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:17,223 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:17,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 110 [2018-12-03 07:19:17,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2018-12-03 07:19:17,283 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:17,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 78 [2018-12-03 07:19:17,413 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:17,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-12-03 07:19:17,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2018-12-03 07:19:17,498 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:17,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-03 07:19:17,516 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:17,525 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:17,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 70 [2018-12-03 07:19:17,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2018-12-03 07:19:17,611 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:17,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 56 [2018-12-03 07:19:17,699 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:19:17,752 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:19:17,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 71 [2018-12-03 07:19:17,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 56 [2018-12-03 07:19:17,873 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:19:17,964 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:19:18,016 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 07:19:18,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:19:18,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 114 [2018-12-03 07:19:18,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:19:18,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 97 [2018-12-03 07:19:18,047 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:18,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 07:19:18,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 60 [2018-12-03 07:19:18,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37 [2018-12-03 07:19:18,075 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:18,083 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:18,096 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:18,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 101 [2018-12-03 07:19:18,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 98 [2018-12-03 07:19:18,214 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-12-03 07:19:18,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 82 [2018-12-03 07:19:18,369 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:18,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 74 [2018-12-03 07:19:18,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 55 [2018-12-03 07:19:18,569 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:19:18,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2018-12-03 07:19:18,650 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:18,732 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 07:19:18,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 69 [2018-12-03 07:19:19,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2018-12-03 07:19:19,023 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:19:19,089 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 07:19:19,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-12-03 07:19:19,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37 [2018-12-03 07:19:19,096 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:19,115 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:19,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 68 [2018-12-03 07:19:19,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-12-03 07:19:19,436 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:19,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-12-03 07:19:19,459 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:19,479 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 07:19:19,764 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-03 07:19:20,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2018-12-03 07:19:20,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-03 07:19:20,417 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:20,419 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:20,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 18 [2018-12-03 07:19:20,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-03 07:19:20,427 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:20,435 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:20,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 13 [2018-12-03 07:19:20,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-03 07:19:20,441 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:20,444 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:20,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 23 [2018-12-03 07:19:20,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-03 07:19:20,449 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:20,457 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:20,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 45 [2018-12-03 07:19:20,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-03 07:19:20,464 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:20,467 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:20,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 18 [2018-12-03 07:19:20,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-03 07:19:20,475 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-03 07:19:20,484 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:19:20,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-03 07:19:20,532 INFO L202 ElimStorePlain]: Needed 61 recursive calls to eliminate 4 variables, input treesize:148, output treesize:80 [2018-12-03 07:19:20,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 07:19:20,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 30] total 61 [2018-12-03 07:19:20,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 07:19:20,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 07:19:20,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=6421, Unknown=7, NotChecked=0, Total=6806 [2018-12-03 07:19:20,865 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 61 states. [2018-12-03 07:19:25,029 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2018-12-03 07:19:27,873 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-12-03 07:19:36,863 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-12-03 07:19:38,164 WARN L180 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-12-03 07:19:38,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:19:38,681 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-12-03 07:19:38,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 07:19:38,682 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-12-03 07:19:38,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:19:38,683 INFO L225 Difference]: With dead ends: 76 [2018-12-03 07:19:38,683 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 07:19:38,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4043 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=905, Invalid=12427, Unknown=8, NotChecked=0, Total=13340 [2018-12-03 07:19:38,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 07:19:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-12-03 07:19:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 07:19:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-03 07:19:38,692 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 61 [2018-12-03 07:19:38,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:19:38,692 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-03 07:19:38,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 07:19:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-03 07:19:38,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 07:19:38,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:19:38,692 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:19:38,693 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:19:38,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:19:38,693 INFO L82 PathProgramCache]: Analyzing trace with hash -610417144, now seen corresponding path program 2 times [2018-12-03 07:19:38,693 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 07:19:38,693 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 07:19:38,714 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-03 07:19:38,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:19:38,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:19:38,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:19:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 07:19:38,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:19:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 07:19:38,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:19:38,967 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_616b5908-0987-4ca3-880b-97e25f58c0d5/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:19:38,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-03 07:19:39,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 07:19:39,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:19:39,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:19:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 07:19:39,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:19:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 07:19:39,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 07:19:39,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-03 07:19:39,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 07:19:39,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 07:19:39,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-03 07:19:39,434 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 18 states. [2018-12-03 07:19:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:19:40,014 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-12-03 07:19:40,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 07:19:40,014 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2018-12-03 07:19:40,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:19:40,014 INFO L225 Difference]: With dead ends: 67 [2018-12-03 07:19:40,014 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 07:19:40,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-12-03 07:19:40,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 07:19:40,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 07:19:40,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 07:19:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 07:19:40,015 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2018-12-03 07:19:40,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:19:40,015 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 07:19:40,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 07:19:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 07:19:40,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 07:19:40,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 07:19:40,527 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2018-12-03 07:19:40,891 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2018-12-03 07:19:41,391 WARN L180 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-12-03 07:19:41,601 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2018-12-03 07:19:42,263 WARN L180 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 106 [2018-12-03 07:19:42,522 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2018-12-03 07:19:42,918 WARN L180 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2018-12-03 07:19:42,920 INFO L444 ceAbstractionStarter]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse1 (= |old(#memory_int)| |#memory_int|)) (.cse2 (= dll_update_at_~data |dll_update_at_#in~data|)) (.cse4 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse5 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (let ((.cse0 (and .cse1 .cse2 (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|) .cse4 .cse5 (= dll_update_at_~index |dll_update_at_#in~index|) (= |dll_update_at_#in~head.base| dll_update_at_~head.base)))) (and (or .cse0 (bvsgt (bvadd |dll_update_at_#in~index| (_ bv4294967295 32)) (_ bv0 32)) (let ((.cse3 (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) (and .cse1 .cse2 (= dll_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |dll_update_at_#in~head.base|) .cse3)) .cse4 .cse5 (= (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) .cse3) dll_update_at_~head.base) (= (bvadd dll_update_at_~index (_ bv1 32)) |dll_update_at_#in~index|))) (forall ((v_main_~s~0.base_BEFORE_CALL_6 (_ BitVec 32))) (not (= (_ bv2 32) (select (select |old(#memory_int)| v_main_~s~0.base_BEFORE_CALL_6) (_ bv0 32)))))) (or .cse0 (bvsgt |dll_update_at_#in~index| (_ bv0 32)))))) [2018-12-03 07:19:42,920 INFO L448 ceAbstractionStarter]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2018-12-03 07:19:42,920 INFO L444 ceAbstractionStarter]: At program point dll_update_atENTRY(lines 606 612) the Hoare annotation is: (let ((.cse0 (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (and (or (bvsgt |dll_update_at_#in~index| (_ bv0 32)) .cse0) (or .cse0 (bvsgt (bvadd |dll_update_at_#in~index| (_ bv4294967295 32)) (_ bv0 32)) (forall ((v_main_~s~0.base_BEFORE_CALL_6 (_ BitVec 32))) (not (= (_ bv2 32) (select (select |old(#memory_int)| v_main_~s~0.base_BEFORE_CALL_6) (_ bv0 32)))))))) [2018-12-03 07:19:42,920 INFO L448 ceAbstractionStarter]: For program point dll_update_atEXIT(lines 606 612) no Hoare annotation was computed. [2018-12-03 07:19:42,920 INFO L448 ceAbstractionStarter]: For program point dll_update_atFINAL(lines 606 612) no Hoare annotation was computed. [2018-12-03 07:19:42,921 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-03 07:19:42,921 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-03 07:19:42,921 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 07:19:42,921 INFO L451 ceAbstractionStarter]: At program point myexitENTRY(lines 561 563) the Hoare annotation is: true [2018-12-03 07:19:42,921 INFO L448 ceAbstractionStarter]: For program point myexitFINAL(lines 561 563) no Hoare annotation was computed. [2018-12-03 07:19:42,921 INFO L448 ceAbstractionStarter]: For program point myexitEXIT(lines 561 563) no Hoare annotation was computed. [2018-12-03 07:19:42,921 INFO L451 ceAbstractionStarter]: At program point L562(line 562) the Hoare annotation is: true [2018-12-03 07:19:42,921 INFO L448 ceAbstractionStarter]: For program point L578-1(lines 578 580) no Hoare annotation was computed. [2018-12-03 07:19:42,921 INFO L444 ceAbstractionStarter]: At program point dll_createENTRY(lines 574 591) the Hoare annotation is: (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-03 07:19:42,921 INFO L444 ceAbstractionStarter]: At program point L576-2(lines 576 589) the Hoare annotation is: (let ((.cse14 (= (_ bv0 32) dll_create_~head~0.base))) (let ((.cse1 (= (bvadd (select |#valid| dll_create_~head~0.base) (_ bv1 1)) (_ bv0 1))) (.cse4 (not (= dll_create_~new_head~0.base (_ bv0 32)))) (.cse0 (= (_ bv0 32) dll_create_~new_head~0.offset)) (.cse2 (= (_ bv1 1) (select |#valid| dll_create_~new_head~0.base))) (.cse5 (not .cse14)) (.cse3 (= (_ bv0 32) dll_create_~head~0.offset))) (or (and .cse0 (= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|) .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse6 (select |#memory_$Pointer$.offset| dll_create_~new_head~0.base)) (.cse8 (bvadd dll_create_~new_head~0.offset (_ bv8 32))) (.cse11 (select |#memory_$Pointer$.base| dll_create_~new_head~0.base)) (.cse7 (bvadd dll_create_~new_head~0.offset (_ bv4 32))) (.cse9 (select |#memory_$Pointer$.base| dll_create_~head~0.base)) (.cse13 (bvadd dll_create_~head~0.offset (_ bv8 32))) (.cse12 (select |#memory_$Pointer$.offset| dll_create_~head~0.base)) (.cse10 (bvadd dll_create_~head~0.offset (_ bv4 32)))) (and (exists ((dll_create_~head~0.offset (_ BitVec 32))) (= dll_create_~new_head~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (bvadd dll_create_~new_head~0.offset (_ bv4 32)))) (bvadd dll_create_~head~0.offset (_ bv8 32))))) (= (select .cse6 .cse7) (_ bv0 32)) .cse1 .cse4 (= (_ bv0 32) (select .cse6 .cse8)) (not (= (select .cse9 .cse10) dll_create_~head~0.base)) (= (_ bv0 32) (select .cse11 .cse8)) .cse0 (= (select .cse12 .cse13) (_ bv0 32)) (exists ((dll_create_~head~0.base (_ BitVec 32))) (and (not (= dll_create_~new_head~0.base dll_create_~head~0.base)) (= dll_create_~new_head~0.offset (select (select |#memory_$Pointer$.offset| dll_create_~head~0.base) (_ bv8 32))))) (not (= dll_create_~new_head~0.base (select .cse11 .cse7))) .cse2 (= (_ bv0 32) (select .cse9 .cse13)) .cse3 .cse5 (exists ((v_subst_1 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) (bvadd dll_create_~head~0.offset (_ bv4 32)))) (bvadd v_subst_1 (_ bv8 32))) dll_create_~head~0.base)) (= (select .cse12 .cse10) (_ bv0 32)))) (and (= |old(#memory_int)| |#memory_int|) .cse14 .cse3 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= dll_create_~len |dll_create_#in~len|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))) [2018-12-03 07:19:42,921 INFO L448 ceAbstractionStarter]: For program point L576-3(lines 576 589) no Hoare annotation was computed. [2018-12-03 07:19:42,921 INFO L448 ceAbstractionStarter]: For program point dll_createFINAL(lines 574 591) no Hoare annotation was computed. [2018-12-03 07:19:42,922 INFO L451 ceAbstractionStarter]: At program point L579(line 579) the Hoare annotation is: true [2018-12-03 07:19:42,922 INFO L448 ceAbstractionStarter]: For program point dll_createEXIT(lines 574 591) no Hoare annotation was computed. [2018-12-03 07:19:42,922 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2018-12-03 07:19:42,922 INFO L448 ceAbstractionStarter]: For program point L584-2(lines 584 586) no Hoare annotation was computed. [2018-12-03 07:19:42,922 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 580) no Hoare annotation was computed. [2018-12-03 07:19:42,922 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 07:19:42,922 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-03 07:19:42,922 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 07:19:42,922 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 07:19:42,922 INFO L444 ceAbstractionStarter]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse1 (forall ((v_main_~s~0.base_BEFORE_CALL_20 (_ BitVec 32))) (let ((.cse10 (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_20))) (let ((.cse9 (select .cse10 (_ bv4 32)))) (or (not (= (_ bv3 32) (select (select |#memory_int| .cse9) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_20) (_ bv4 32))))) (= .cse9 v_main_~s~0.base_BEFORE_CALL_20) (not (= (select .cse10 (_ bv8 32)) (_ bv0 32)))))))) (.cse2 (forall ((v_subst_3 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_14 (_ BitVec 32))) (let ((.cse8 (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_14))) (let ((.cse7 (select .cse8 (_ bv4 32)))) (or (not (= (_ bv3 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_14) (_ bv4 32))) .cse7))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_subst_3) (_ bv8 32)))) (not (= (select .cse8 (_ bv8 32)) (_ bv0 32))) (not (= (_ bv0 32) .cse7)) (= v_main_~s~0.base_BEFORE_CALL_14 v_subst_3)))))) (.cse0 (and (= |dll_get_data_at_#in~index| dll_get_data_at_~index) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base)))) (and (or .cse0 .cse1 .cse2 (forall ((v_main_~s~0.base_BEFORE_CALL_6 (_ BitVec 32))) (not (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_6) (_ bv0 32))))) (bvsgt |dll_get_data_at_#in~index| (_ bv0 32))) (or .cse1 (bvsgt (bvadd |dll_get_data_at_#in~index| (_ bv4294967295 32)) (_ bv0 32)) .cse2 (forall ((v_main_~s~0.base_BEFORE_CALL_15 (_ BitVec 32))) (let ((.cse5 (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_15))) (let ((.cse3 (select .cse5 (_ bv4 32))) (.cse4 (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_15) (_ bv0 32)))) (or (not (= (_ bv0 32) .cse3)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_15) (_ bv4 32))) .cse3) (_ bv4294967295 32)) (bvneg (bvneg .cse4)))) (not (= (bvadd .cse4 (_ bv4294967294 32)) (_ bv0 32))) (not (= (select .cse5 (_ bv8 32)) (_ bv0 32))))))) (let ((.cse6 (bvadd |dll_get_data_at_#in~head.offset| (_ bv4 32)))) (and (= (select (select |#memory_$Pointer$.base| |dll_get_data_at_#in~head.base|) .cse6) dll_get_data_at_~head.base) (= (bvadd dll_get_data_at_~index (_ bv1 32)) |dll_get_data_at_#in~index|) (= dll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |dll_get_data_at_#in~head.base|) .cse6)))) .cse0))) [2018-12-03 07:19:42,922 INFO L448 ceAbstractionStarter]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2018-12-03 07:19:42,922 INFO L448 ceAbstractionStarter]: For program point dll_get_data_atFINAL(lines 599 605) no Hoare annotation was computed. [2018-12-03 07:19:42,923 INFO L451 ceAbstractionStarter]: At program point dll_get_data_atENTRY(lines 599 605) the Hoare annotation is: true [2018-12-03 07:19:42,923 INFO L448 ceAbstractionStarter]: For program point dll_get_data_atEXIT(lines 599 605) no Hoare annotation was computed. [2018-12-03 07:19:42,923 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 613 632) no Hoare annotation was computed. [2018-12-03 07:19:42,923 INFO L448 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-12-03 07:19:42,923 INFO L444 ceAbstractionStarter]: At program point L624(line 624) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse11 (select |#memory_$Pointer$.offset| main_~s~0.base))) (let ((.cse10 (bvadd (let ((.cse14 (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_int| (select .cse12 .cse14)) (select .cse11 .cse14))) (_ bv4294967295 32))) (.cse13 (bvneg main_~len~0))) (let ((.cse0 (= (select .cse11 (_ bv8 32)) (_ bv0 32))) (.cse5 (= main_~s~0.offset (_ bv0 32))) (.cse3 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse2 (= .cse10 (bvneg .cse13))) (.cse6 (= (bvadd .cse13 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse4 (exists ((v_subst_3 (_ BitVec 32))) (and (not (= v_subst_3 main_~s~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_subst_3) (_ bv8 32)))))) (.cse7 (= (_ bv0 32) (select .cse12 (bvadd main_~s~0.offset (_ bv8 32))))) (.cse8 (= (select .cse11 (_ bv4 32)) (_ bv0 32))) (.cse1 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (or (and .cse0 (= main_~len~0 .cse1) .cse2 (and .cse3 (= main_~i~0 (_ bv0 32))) .cse4 .cse5 .cse6 (= (bvadd main_~len~0 main_~i~0) main_~expected~0) .cse7 .cse8) (let ((.cse9 (bvneg .cse1))) (and .cse0 .cse5 .cse3 .cse2 (= (_ bv1 32) (bvadd .cse9 main_~expected~0)) .cse6 .cse4 (= .cse10 (bvneg .cse9)) .cse7 .cse8 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))))))) [2018-12-03 07:19:42,923 INFO L448 ceAbstractionStarter]: For program point L624-1(lines 624 626) no Hoare annotation was computed. [2018-12-03 07:19:42,923 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2018-12-03 07:19:42,923 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 613 632) no Hoare annotation was computed. [2018-12-03 07:19:42,923 INFO L444 ceAbstractionStarter]: At program point L620(line 620) the Hoare annotation is: (let ((.cse9 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse8 (select |#memory_$Pointer$.offset| main_~s~0.base))) (let ((.cse1 (= (select .cse8 (_ bv8 32)) (_ bv0 32))) (.cse2 (not (= (select .cse9 (bvadd main_~s~0.offset (_ bv4 32))) main_~s~0.base))) (.cse4 (= main_~s~0.offset (_ bv0 32))) (.cse3 (exists ((v_subst_4 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (bvadd v_subst_4 (_ bv8 32))) main_~s~0.base))) (.cse0 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse5 (exists ((v_subst_3 (_ BitVec 32))) (and (not (= v_subst_3 main_~s~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_subst_3) (_ bv8 32)))))) (.cse6 (= (_ bv0 32) (select .cse9 (bvadd main_~s~0.offset (_ bv8 32))))) (.cse7 (= (select .cse8 (_ bv4 32)) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (bvadd (bvneg main_~len~0) main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32)) .cse5 .cse6 .cse7 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse1 .cse2 (= main_~len~0 main_~new_data~0) .cse4 .cse3 (= main_~i~0 (_ bv0 32)) .cse0 .cse5 .cse6 .cse7)))) [2018-12-03 07:19:42,924 INFO L448 ceAbstractionStarter]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2018-12-03 07:19:42,924 INFO L448 ceAbstractionStarter]: For program point L620-1(lines 618 621) no Hoare annotation was computed. [2018-12-03 07:19:42,924 INFO L444 ceAbstractionStarter]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse15 (bvsgt main_~i~0 (_ bv0 32))) (.cse4 (= main_~i~0 (_ bv0 32)))) (let ((.cse12 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse13 (bvneg main_~len~0)) (.cse11 (select |#memory_$Pointer$.offset| main_~s~0.base)) (.cse2 (let ((.cse16 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))) (or (and .cse15 .cse16) (and .cse16 .cse4)))) (.cse3 (= main_~s~0.offset (_ bv0 32))) (.cse5 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))) (let ((.cse0 (and .cse15 (and .cse2 .cse3 .cse5))) (.cse1 (= (select .cse11 (_ bv8 32)) (_ bv0 32))) (.cse6 (= (bvadd (let ((.cse14 (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_int| (select .cse12 .cse14)) (select .cse11 .cse14))) (_ bv4294967295 32)) (bvneg .cse13))) (.cse7 (= (bvadd .cse13 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse8 (exists ((v_subst_3 (_ BitVec 32))) (and (not (= v_subst_3 main_~s~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_subst_3) (_ bv8 32)))))) (.cse9 (= (_ bv0 32) (select .cse12 (bvadd main_~s~0.offset (_ bv8 32))))) (.cse10 (= (select .cse11 (_ bv4 32)) (_ bv0 32)))) (or (and .cse0 (= (_ bv2 32) main_~i~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))))) [2018-12-03 07:19:42,924 INFO L444 ceAbstractionStarter]: At program point L622-4(lines 622 627) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-12-03 07:19:42,924 INFO L444 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-03 07:19:42,924 INFO L444 ceAbstractionStarter]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse13 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse11 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse10 (select |#memory_$Pointer$.offset| main_~s~0.base)) (.cse9 (select .cse13 .cse11))) (let ((.cse1 (not (= .cse9 main_~s~0.base))) (.cse3 (exists ((v_subst_4 (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (bvadd v_subst_4 (_ bv8 32))) main_~s~0.base))) (.cse0 (= (select .cse10 (_ bv8 32)) (_ bv0 32))) (.cse4 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse8 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (.cse5 (exists ((v_subst_3 (_ BitVec 32))) (and (not (= v_subst_3 main_~s~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_subst_3) (_ bv8 32)))))) (.cse2 (= main_~s~0.offset (_ bv0 32))) (.cse6 (= (_ bv0 32) (select .cse13 (bvadd main_~s~0.offset (_ bv8 32))))) (.cse7 (= (select .cse10 (_ bv4 32)) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~i~0 (_ bv0 32)) .cse4 .cse5 .cse6 .cse7) (and .cse0 (= main_~len~0 main_~new_data~0) .cse1 .cse3 .cse2 .cse4 .cse8 .cse5 .cse6 .cse7 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse12 (bvneg main_~len~0))) (and .cse0 .cse4 .cse8 (= (bvadd (select (select |#memory_int| .cse9) (select .cse10 .cse11)) (_ bv4294967295 32)) (bvneg .cse12)) .cse5 .cse2 (= (bvadd .cse12 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) .cse6 .cse7)))))) [2018-12-03 07:19:42,924 INFO L448 ceAbstractionStarter]: For program point L616-1(line 616) no Hoare annotation was computed. [2018-12-03 07:19:42,924 INFO L448 ceAbstractionStarter]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2018-12-03 07:19:42,924 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 613 632) the Hoare annotation is: (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-03 07:19:42,925 INFO L444 ceAbstractionStarter]: At program point L625(lines 613 632) the Hoare annotation is: false [2018-12-03 07:19:42,925 INFO L448 ceAbstractionStarter]: For program point dll_destroyEXIT(lines 592 598) no Hoare annotation was computed. [2018-12-03 07:19:42,925 INFO L451 ceAbstractionStarter]: At program point dll_destroyENTRY(lines 592 598) the Hoare annotation is: true [2018-12-03 07:19:42,925 INFO L451 ceAbstractionStarter]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2018-12-03 07:19:42,925 INFO L448 ceAbstractionStarter]: For program point L593-3(lines 592 598) no Hoare annotation was computed. [2018-12-03 07:19:42,931 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-12-03 07:19:42,933 INFO L168 Benchmark]: Toolchain (without parser) took 97319.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.3 MB). Free memory was 939.3 MB in the beginning and 988.3 MB in the end (delta: -49.0 MB). Peak memory consumption was 388.0 MB. Max. memory is 11.5 GB. [2018-12-03 07:19:42,934 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:19:42,934 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2018-12-03 07:19:42,934 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:19:42,934 INFO L168 Benchmark]: Boogie Preprocessor took 20.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:19:42,934 INFO L168 Benchmark]: RCFGBuilder took 292.44 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: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-12-03 07:19:42,934 INFO L168 Benchmark]: TraceAbstraction took 96696.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 988.3 MB in the end (delta: 100.7 MB). Peak memory consumption was 402.4 MB. Max. memory is 11.5 GB. [2018-12-03 07:19:42,936 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 288.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 292.44 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: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 96696.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 988.3 MB in the end (delta: 100.7 MB). Peak memory consumption was 402.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 630]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...