java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loops/linear_sea.ch_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 04:55:18,586 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 04:55:18,589 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 04:55:18,601 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 04:55:18,602 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 04:55:18,603 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 04:55:18,604 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 04:55:18,606 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 04:55:18,608 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 04:55:18,609 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 04:55:18,610 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 04:55:18,610 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 04:55:18,611 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 04:55:18,612 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 04:55:18,613 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 04:55:18,614 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 04:55:18,615 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 04:55:18,617 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 04:55:18,619 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 04:55:18,620 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 04:55:18,622 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 04:55:18,623 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 04:55:18,625 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 04:55:18,626 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 04:55:18,626 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 04:55:18,627 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 04:55:18,628 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 04:55:18,629 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 04:55:18,630 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 04:55:18,631 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 04:55:18,631 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 04:55:18,632 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 04:55:18,632 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 04:55:18,632 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 04:55:18,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 04:55:18,634 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 04:55:18,634 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 04:55:18,651 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 04:55:18,652 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 04:55:18,653 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 04:55:18,653 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 04:55:18,653 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 04:55:18,653 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 04:55:18,655 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 04:55:18,655 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 04:55:18,656 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 04:55:18,656 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 04:55:18,656 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 04:55:18,656 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 04:55:18,657 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 04:55:18,658 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 04:55:18,658 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 04:55:18,658 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 04:55:18,658 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 04:55:18,658 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 04:55:18,660 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 04:55:18,660 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 04:55:18,660 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 04:55:18,660 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 04:55:18,660 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 04:55:18,661 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 04:55:18,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:55:18,661 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 04:55:18,661 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 04:55:18,661 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 04:55:18,662 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 04:55:18,662 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 04:55:18,662 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 04:55:18,662 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 04:55:18,663 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 04:55:18,663 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 04:55:18,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 04:55:18,726 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 04:55:18,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 04:55:18,732 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 04:55:18,733 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 04:55:18,733 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_sea.ch_true-unreach-call.i [2018-11-07 04:55:18,804 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1ca3de41/e6ab168249b8413e9632aad67f7f912b/FLAGee9ebffb9 [2018-11-07 04:55:19,269 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 04:55:19,270 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch_true-unreach-call.i [2018-11-07 04:55:19,277 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1ca3de41/e6ab168249b8413e9632aad67f7f912b/FLAGee9ebffb9 [2018-11-07 04:55:19,295 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1ca3de41/e6ab168249b8413e9632aad67f7f912b [2018-11-07 04:55:19,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 04:55:19,307 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 04:55:19,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 04:55:19,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 04:55:19,313 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 04:55:19,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:55:19" (1/1) ... [2018-11-07 04:55:19,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c7c1c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:19, skipping insertion in model container [2018-11-07 04:55:19,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:55:19" (1/1) ... [2018-11-07 04:55:19,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 04:55:19,348 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 04:55:19,574 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:55:19,585 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 04:55:19,606 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:55:19,632 INFO L193 MainTranslator]: Completed translation [2018-11-07 04:55:19,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:19 WrapperNode [2018-11-07 04:55:19,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 04:55:19,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 04:55:19,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 04:55:19,635 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 04:55:19,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:19" (1/1) ... [2018-11-07 04:55:19,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:19" (1/1) ... [2018-11-07 04:55:19,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 04:55:19,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 04:55:19,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 04:55:19,664 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 04:55:19,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:19" (1/1) ... [2018-11-07 04:55:19,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:19" (1/1) ... [2018-11-07 04:55:19,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:19" (1/1) ... [2018-11-07 04:55:19,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:19" (1/1) ... [2018-11-07 04:55:19,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:19" (1/1) ... [2018-11-07 04:55:19,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:19" (1/1) ... [2018-11-07 04:55:19,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:19" (1/1) ... [2018-11-07 04:55:19,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 04:55:19,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 04:55:19,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 04:55:19,694 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 04:55:19,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:55:19,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 04:55:19,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 04:55:19,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 04:55:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2018-11-07 04:55:19,860 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2018-11-07 04:55:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 04:55:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 04:55:19,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 04:55:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 04:55:19,862 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 04:55:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 04:55:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 04:55:19,862 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 04:55:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 04:55:20,300 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 04:55:20,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:55:20 BoogieIcfgContainer [2018-11-07 04:55:20,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 04:55:20,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 04:55:20,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 04:55:20,306 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 04:55:20,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:55:19" (1/3) ... [2018-11-07 04:55:20,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b7279b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:55:20, skipping insertion in model container [2018-11-07 04:55:20,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:19" (2/3) ... [2018-11-07 04:55:20,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b7279b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:55:20, skipping insertion in model container [2018-11-07 04:55:20,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:55:20" (3/3) ... [2018-11-07 04:55:20,310 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_sea.ch_true-unreach-call.i [2018-11-07 04:55:20,320 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 04:55:20,328 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 04:55:20,344 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 04:55:20,380 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 04:55:20,381 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 04:55:20,381 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 04:55:20,381 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 04:55:20,381 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 04:55:20,382 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 04:55:20,382 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 04:55:20,382 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 04:55:20,402 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-07 04:55:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 04:55:20,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:20,410 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:20,412 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:20,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:20,420 INFO L82 PathProgramCache]: Analyzing trace with hash -519389311, now seen corresponding path program 1 times [2018-11-07 04:55:20,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:20,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:20,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:20,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:20,477 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:55:20,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:55:20,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 04:55:20,620 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:55:20,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 04:55:20,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 04:55:20,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:55:20,644 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-07 04:55:20,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:20,668 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-07 04:55:20,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 04:55:20,670 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-07 04:55:20,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:20,678 INFO L225 Difference]: With dead ends: 52 [2018-11-07 04:55:20,678 INFO L226 Difference]: Without dead ends: 25 [2018-11-07 04:55:20,682 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:55:20,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-07 04:55:20,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-07 04:55:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 04:55:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-07 04:55:20,719 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 19 [2018-11-07 04:55:20,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:20,720 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-07 04:55:20,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 04:55:20,720 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-07 04:55:20,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 04:55:20,721 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:20,721 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:20,722 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:20,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:20,722 INFO L82 PathProgramCache]: Analyzing trace with hash -277831210, now seen corresponding path program 1 times [2018-11-07 04:55:20,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:20,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:20,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:20,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:20,724 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:55:20,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:55:20,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 04:55:20,993 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:55:20,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 04:55:20,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 04:55:20,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:55:20,996 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 6 states. [2018-11-07 04:55:21,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:21,104 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-07 04:55:21,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 04:55:21,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-07 04:55:21,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:21,106 INFO L225 Difference]: With dead ends: 33 [2018-11-07 04:55:21,107 INFO L226 Difference]: Without dead ends: 25 [2018-11-07 04:55:21,108 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:55:21,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-07 04:55:21,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-07 04:55:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 04:55:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-07 04:55:21,113 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-11-07 04:55:21,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:21,114 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-07 04:55:21,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 04:55:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-07 04:55:21,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 04:55:21,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:21,115 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:21,116 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:21,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:21,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1464979125, now seen corresponding path program 1 times [2018-11-07 04:55:21,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:21,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:21,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:21,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:21,118 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:21,609 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-11-07 04:55:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:55:21,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:55:21,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 04:55:21,612 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:55:21,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 04:55:21,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 04:55:21,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:55:21,614 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2018-11-07 04:55:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:21,723 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-07 04:55:21,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 04:55:21,724 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-07 04:55:21,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:21,726 INFO L225 Difference]: With dead ends: 40 [2018-11-07 04:55:21,726 INFO L226 Difference]: Without dead ends: 31 [2018-11-07 04:55:21,727 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:55:21,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-07 04:55:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-07 04:55:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-07 04:55:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-07 04:55:21,735 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2018-11-07 04:55:21,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:21,735 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-07 04:55:21,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 04:55:21,736 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-07 04:55:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 04:55:21,737 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:21,737 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:21,737 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:21,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:21,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1882483549, now seen corresponding path program 1 times [2018-11-07 04:55:21,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:21,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:21,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:21,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:21,739 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:55:21,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:55:21,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 04:55:21,805 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:55:21,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 04:55:21,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 04:55:21,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:55:21,807 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 3 states. [2018-11-07 04:55:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:21,829 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-07 04:55:21,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 04:55:21,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-07 04:55:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:21,830 INFO L225 Difference]: With dead ends: 48 [2018-11-07 04:55:21,831 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 04:55:21,831 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:55:21,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 04:55:21,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-07 04:55:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 04:55:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-07 04:55:21,838 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2018-11-07 04:55:21,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:21,839 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-07 04:55:21,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 04:55:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-07 04:55:21,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 04:55:21,840 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:21,840 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 04:55:21,841 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:21,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:21,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1265780096, now seen corresponding path program 1 times [2018-11-07 04:55:21,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:21,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:21,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:21,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:21,843 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:24,549 WARN L179 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 27 [2018-11-07 04:55:24,767 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 18 [2018-11-07 04:55:24,946 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2018-11-07 04:55:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:55:25,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:25,317 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:25,318 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-07 04:55:25,320 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [12], [13], [15], [19], [21], [28], [29], [33], [34], [35], [37], [43], [46], [48], [54], [55], [56], [58], [59], [60] [2018-11-07 04:55:25,379 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:55:25,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:55:25,523 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:55:27,975 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:55:27,977 INFO L272 AbstractInterpreter]: Visited 26 different actions 424 times. Merged at 10 different actions 306 times. Widened at 1 different actions 27 times. Found 93 fixpoints after 5 different actions. Largest state had 25 variables. [2018-11-07 04:55:28,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:28,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:55:28,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:28,027 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:55:28,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:28,040 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:55:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:28,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:28,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-07 04:55:28,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-07 04:55:28,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:30,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:30,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-11-07 04:55:30,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-07 04:55:30,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:30,339 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:32,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:32,386 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:17 [2018-11-07 04:55:33,323 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-07 04:55:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:55:34,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:34,493 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2018-11-07 04:55:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:55:35,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:35,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2018-11-07 04:55:35,546 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:35,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 04:55:35,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 04:55:35,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=746, Unknown=1, NotChecked=0, Total=870 [2018-11-07 04:55:35,549 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 20 states. [2018-11-07 04:55:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:40,326 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-07 04:55:40,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 04:55:40,327 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-11-07 04:55:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:40,329 INFO L225 Difference]: With dead ends: 48 [2018-11-07 04:55:40,329 INFO L226 Difference]: Without dead ends: 38 [2018-11-07 04:55:40,330 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=192, Invalid=997, Unknown=1, NotChecked=0, Total=1190 [2018-11-07 04:55:40,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-07 04:55:40,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-07 04:55:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 04:55:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-07 04:55:40,337 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 28 [2018-11-07 04:55:40,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:40,337 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-07 04:55:40,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 04:55:40,338 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-07 04:55:40,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-07 04:55:40,340 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:40,340 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 04:55:40,341 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:40,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:40,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1149133323, now seen corresponding path program 2 times [2018-11-07 04:55:40,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:40,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:40,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:40,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:40,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:40,748 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 3 [2018-11-07 04:55:41,098 WARN L179 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 24 [2018-11-07 04:55:41,403 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2018-11-07 04:55:41,569 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2018-11-07 04:55:41,914 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2018-11-07 04:55:42,176 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2018-11-07 04:55:42,340 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2018-11-07 04:55:42,488 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2018-11-07 04:55:42,649 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2018-11-07 04:55:42,861 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-11-07 04:55:43,018 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-11-07 04:55:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:55:43,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:43,387 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:43,387 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:43,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:43,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:43,387 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:55:43,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:55:43,399 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:55:43,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 04:55:43,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:55:43,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:51,655 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 35 DAG size of output: 13 [2018-11-07 04:55:51,718 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-07 04:55:51,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:53,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2018-11-07 04:55:53,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-07 04:55:53,803 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:53,806 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:53,816 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-11-07 04:55:53,816 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:30 [2018-11-07 04:55:54,001 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-07 04:55:56,873 WARN L179 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 46 [2018-11-07 04:55:57,711 WARN L179 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-07 04:56:00,901 WARN L179 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-11-07 04:56:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:56:01,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:56:01,287 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2018-11-07 04:56:04,282 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-11-07 04:56:05,523 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-11-07 04:56:05,783 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-07 04:56:05,795 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 04:56:05,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:05,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:05,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:181, output treesize:1 [2018-11-07 04:56:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:56:05,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:56:05,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 13] total 41 [2018-11-07 04:56:05,839 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:56:05,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 04:56:05,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 04:56:05,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1451, Unknown=4, NotChecked=0, Total=1640 [2018-11-07 04:56:05,843 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 30 states. [2018-11-07 04:56:06,348 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2018-11-07 04:56:08,187 WARN L179 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2018-11-07 04:56:10,418 WARN L179 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-11-07 04:56:10,633 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2018-11-07 04:56:14,932 WARN L179 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 117 DAG size of output: 88 [2018-11-07 04:56:15,464 WARN L179 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 43 [2018-11-07 04:56:16,045 WARN L179 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 49 [2018-11-07 04:56:18,236 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-11-07 04:56:24,558 WARN L179 SmtUtils]: Spent 6.20 s on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2018-11-07 04:56:24,751 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-11-07 04:56:25,662 WARN L179 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2018-11-07 04:56:25,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:56:25,748 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-07 04:56:25,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 04:56:25,749 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2018-11-07 04:56:25,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:56:25,750 INFO L225 Difference]: With dead ends: 57 [2018-11-07 04:56:25,750 INFO L226 Difference]: Without dead ends: 44 [2018-11-07 04:56:25,751 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 41.3s TimeCoverageRelationStatistics Valid=391, Invalid=2467, Unknown=4, NotChecked=0, Total=2862 [2018-11-07 04:56:25,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-07 04:56:25,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-07 04:56:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 04:56:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-11-07 04:56:25,759 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 34 [2018-11-07 04:56:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:56:25,759 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-11-07 04:56:25,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 04:56:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-07 04:56:25,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-07 04:56:25,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:56:25,761 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:56:25,761 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:56:25,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:56:25,762 INFO L82 PathProgramCache]: Analyzing trace with hash 169342294, now seen corresponding path program 3 times [2018-11-07 04:56:25,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:56:25,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:25,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:56:25,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:25,763 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:56:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:56:26,491 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2018-11-07 04:56:26,683 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2018-11-07 04:56:26,837 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 29 [2018-11-07 04:56:27,180 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 41 [2018-11-07 04:56:27,323 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 42 [2018-11-07 04:56:27,516 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 43 [2018-11-07 04:56:27,826 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2018-11-07 04:56:28,071 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2018-11-07 04:56:28,266 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2018-11-07 04:56:28,899 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 48 [2018-11-07 04:56:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:56:28,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:28,912 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:56:28,912 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:56:28,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:56:28,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:28,912 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:56:28,923 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:56:28,923 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:56:28,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:56:28,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:56:29,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:56:29,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-11-07 04:56:29,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-07 04:56:29,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:31,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:31,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-11-07 04:56:31,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-07 04:56:31,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:31,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:35,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:35,096 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-11-07 04:56:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:56:36,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:56:36,493 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2018-11-07 04:56:38,063 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2018-11-07 04:56:39,040 WARN L179 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-07 04:56:39,081 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 04:56:39,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:39,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 10 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:39,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 30 variables, input treesize:798, output treesize:1 [2018-11-07 04:56:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:56:39,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:56:39,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 47 [2018-11-07 04:56:39,188 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:56:39,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 04:56:39,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 04:56:39,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1983, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 04:56:39,191 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 33 states. [2018-11-07 04:56:39,938 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2018-11-07 04:56:40,181 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2018-11-07 04:56:40,437 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2018-11-07 04:56:40,771 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2018-11-07 04:56:41,248 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 73 [2018-11-07 04:56:41,517 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 49 [2018-11-07 04:56:41,885 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 54 [2018-11-07 04:56:42,194 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 59 [2018-11-07 04:56:42,672 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 102 [2018-11-07 04:56:43,066 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2018-11-07 04:56:43,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:56:43,873 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-07 04:56:43,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 04:56:43,876 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-11-07 04:56:43,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:56:43,878 INFO L225 Difference]: With dead ends: 60 [2018-11-07 04:56:43,878 INFO L226 Difference]: Without dead ends: 50 [2018-11-07 04:56:43,880 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=396, Invalid=3510, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 04:56:43,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-07 04:56:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-07 04:56:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 04:56:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-11-07 04:56:43,889 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 40 [2018-11-07 04:56:43,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:56:43,889 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-11-07 04:56:43,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 04:56:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-07 04:56:43,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-07 04:56:43,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:56:43,891 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:56:43,891 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:56:43,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:56:43,892 INFO L82 PathProgramCache]: Analyzing trace with hash 745186401, now seen corresponding path program 4 times [2018-11-07 04:56:43,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:56:43,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:43,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:56:43,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:43,893 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:56:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:56:44,142 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 3 [2018-11-07 04:56:44,694 WARN L179 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 24 [2018-11-07 04:56:45,045 WARN L179 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-11-07 04:56:45,290 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2018-11-07 04:56:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:56:46,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:46,141 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:56:46,141 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:56:46,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:56:46,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:46,141 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:56:46,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:56:46,151 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:56:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:56:46,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:04,442 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 35 DAG size of output: 13 [2018-11-07 04:57:04,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-11-07 04:57:04,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-07 04:57:04,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:57:04,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:57:04,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2018-11-07 04:57:04,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-07 04:57:04,548 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 04:57:04,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:57:04,605 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-11-07 04:57:04,606 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:142, output treesize:30 [2018-11-07 04:57:07,581 WARN L179 SmtUtils]: Spent 2.27 s on a formula simplification that was a NOOP. DAG size: 47 [2018-11-07 04:57:07,809 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-07 04:57:09,297 WARN L179 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 52 [2018-11-07 04:57:10,416 WARN L179 SmtUtils]: Spent 784.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-07 04:57:10,900 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-11-07 04:57:13,653 WARN L179 SmtUtils]: Spent 2.33 s on a formula simplification that was a NOOP. DAG size: 61 [2018-11-07 04:57:18,504 WARN L179 SmtUtils]: Spent 4.51 s on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2018-11-07 04:57:21,992 WARN L179 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-11-07 04:57:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:22,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:22,504 WARN L179 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 71 [2018-11-07 04:57:23,347 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2018-11-07 04:57:24,076 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-07 04:57:24,363 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-07 04:57:26,765 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-07 04:57:27,158 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-07 04:57:27,489 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-07 04:57:27,987 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-07 04:57:28,487 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-07 04:57:29,152 WARN L179 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-07 04:57:35,355 WARN L179 SmtUtils]: Spent 2.83 s on a formula simplification that was a NOOP. DAG size: 69 [2018-11-07 04:57:39,011 WARN L179 SmtUtils]: Spent 3.28 s on a formula simplification that was a NOOP. DAG size: 73 [2018-11-07 04:57:44,918 WARN L179 SmtUtils]: Spent 5.31 s on a formula simplification that was a NOOP. DAG size: 72 [2018-11-07 04:58:04,011 WARN L179 SmtUtils]: Spent 18.06 s on a formula simplification that was a NOOP. DAG size: 75 [2018-11-07 04:58:24,243 WARN L179 SmtUtils]: Spent 15.91 s on a formula simplification that was a NOOP. DAG size: 78 [2018-11-07 04:59:34,818 WARN L179 SmtUtils]: Spent 1.04 m on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2018-11-07 04:59:34,945 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 04:59:34,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 04:59:37,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 34 dim-0 vars, 34 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:59:37,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 68 variables, input treesize:3701, output treesize:1 [2018-11-07 04:59:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:37,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:37,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 25, 22] total 59 [2018-11-07 04:59:37,112 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:37,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 04:59:37,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 04:59:37,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=3121, Unknown=12, NotChecked=0, Total=3422 [2018-11-07 04:59:37,114 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 39 states. [2018-11-07 04:59:37,664 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-11-07 04:59:37,994 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-11-07 04:59:40,378 WARN L179 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-11-07 04:59:41,088 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2018-11-07 04:59:45,479 WARN L179 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2018-11-07 04:59:45,767 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2018-11-07 04:59:48,571 WARN L179 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 102 DAG size of output: 77 [2018-11-07 04:59:48,950 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 96 Received shutdown request... [2018-11-07 04:59:55,953 WARN L187 SmtUtils]: Removed 2 from assertion stack [2018-11-07 04:59:55,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 04:59:55,953 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 04:59:55,957 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 04:59:55,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:59:55 BoogieIcfgContainer [2018-11-07 04:59:55,958 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 04:59:55,959 INFO L168 Benchmark]: Toolchain (without parser) took 276652.08 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -448.0 MB). Peak memory consumption was 713.8 MB. Max. memory is 7.1 GB. [2018-11-07 04:59:55,960 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 04:59:55,962 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 04:59:55,963 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 04:59:55,963 INFO L168 Benchmark]: Boogie Preprocessor took 29.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 04:59:55,964 INFO L168 Benchmark]: RCFGBuilder took 607.39 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 769.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-07 04:59:55,964 INFO L168 Benchmark]: TraceAbstraction took 275655.37 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 392.7 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 356.6 MB). Peak memory consumption was 749.3 MB. Max. memory is 7.1 GB. [2018-11-07 04:59:55,968 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 325.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 28.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 607.39 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 769.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 275655.37 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 392.7 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 356.6 MB). Peak memory consumption was 749.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (50states) and FLOYD_HOARE automaton (currently 20 states, 39 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 130. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. TIMEOUT Result, 275.5s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 48.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 183 SDtfs, 284 SDslu, 1163 SDs, 0 SdLazy, 1610 SolverSat, 88 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 187 SyntacticMatches, 10 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2963 ImplicationChecksByTransitivity, 239.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 223.2s InterpolantComputationTime, 385 NumberOfCodeBlocks, 385 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 517 ConstructedInterpolants, 108 QuantifiedInterpolants, 1098644 SizeOfPredicates, 73 NumberOfNonLiveVariables, 442 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 8/304 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown