java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-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-1dbac8b [2018-10-27 04:01:57,683 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:01:57,686 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:01:57,704 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:01:57,705 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:01:57,706 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:01:57,707 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:01:57,709 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:01:57,711 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:01:57,712 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:01:57,713 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:01:57,713 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:01:57,714 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:01:57,715 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:01:57,716 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:01:57,717 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:01:57,718 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:01:57,720 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:01:57,723 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:01:57,724 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:01:57,726 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:01:57,727 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:01:57,730 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:01:57,730 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:01:57,730 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:01:57,731 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:01:57,732 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:01:57,733 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:01:57,734 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:01:57,735 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:01:57,735 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:01:57,736 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:01:57,736 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:01:57,737 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:01:57,738 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:01:57,739 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:01:57,739 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-27 04:01:57,760 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:01:57,760 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:01:57,762 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 04:01:57,763 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 04:01:57,763 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 04:01:57,763 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 04:01:57,763 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 04:01:57,763 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 04:01:57,764 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 04:01:57,764 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 04:01:57,764 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 04:01:57,764 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 04:01:57,765 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:01:57,765 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:01:57,766 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:01:57,766 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 04:01:57,766 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:01:57,766 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 04:01:57,766 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 04:01:57,767 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 04:01:57,768 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:01:57,768 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:01:57,769 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:01:57,769 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:01:57,769 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:01:57,769 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:01:57,769 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:01:57,770 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 04:01:57,770 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 04:01:57,770 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:01:57,770 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 04:01:57,770 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 04:01:57,771 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 04:01:57,771 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 04:01:57,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:01:57,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:01:57,849 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:01:57,851 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:01:57,851 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:01:57,852 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/linear_sea.ch_true-unreach-call.i [2018-10-27 04:01:57,922 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a1a6bbbd7/de013f71483d4260834c01480ca32f67/FLAG4469f5c5e [2018-10-27 04:01:58,388 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:01:58,389 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch_true-unreach-call.i [2018-10-27 04:01:58,397 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a1a6bbbd7/de013f71483d4260834c01480ca32f67/FLAG4469f5c5e [2018-10-27 04:01:58,416 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a1a6bbbd7/de013f71483d4260834c01480ca32f67 [2018-10-27 04:01:58,432 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:01:58,433 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 04:01:58,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:01:58,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:01:58,440 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:01:58,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:01:58" (1/1) ... [2018-10-27 04:01:58,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a469783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:58, skipping insertion in model container [2018-10-27 04:01:58,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:01:58" (1/1) ... [2018-10-27 04:01:58,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:01:58,488 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:01:58,786 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:01:58,801 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:01:58,829 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:01:58,846 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:01:58,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:58 WrapperNode [2018-10-27 04:01:58,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:01:58,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 04:01:58,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 04:01:58,849 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 04:01:58,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:58" (1/1) ... [2018-10-27 04:01:58,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:58" (1/1) ... [2018-10-27 04:01:58,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 04:01:58,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:01:58,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:01:58,894 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:01:58,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:58" (1/1) ... [2018-10-27 04:01:58,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:58" (1/1) ... [2018-10-27 04:01:58,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:58" (1/1) ... [2018-10-27 04:01:58,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:58" (1/1) ... [2018-10-27 04:01:58,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:58" (1/1) ... [2018-10-27 04:01:58,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:58" (1/1) ... [2018-10-27 04:01:58,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:58" (1/1) ... [2018-10-27 04:01:58,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:01:58,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:01:58,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:01:58,925 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:01:58,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 04:01:59,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:01:59,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:01:59,107 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2018-10-27 04:01:59,108 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2018-10-27 04:01:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:01:59,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:01:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:01:59,108 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:01:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 04:01:59,109 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 04:01:59,570 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:01:59,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:01:59 BoogieIcfgContainer [2018-10-27 04:01:59,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:01:59,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:01:59,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:01:59,577 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:01:59,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:01:58" (1/3) ... [2018-10-27 04:01:59,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e637c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:01:59, skipping insertion in model container [2018-10-27 04:01:59,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:01:58" (2/3) ... [2018-10-27 04:01:59,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e637c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:01:59, skipping insertion in model container [2018-10-27 04:01:59,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:01:59" (3/3) ... [2018-10-27 04:01:59,582 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_sea.ch_true-unreach-call.i [2018-10-27 04:01:59,595 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:01:59,607 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 04:01:59,628 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 04:01:59,669 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:01:59,669 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 04:01:59,669 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:01:59,670 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:01:59,670 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:01:59,671 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:01:59,671 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:01:59,672 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:01:59,696 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-10-27 04:01:59,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-27 04:01:59,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:01:59,706 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:01:59,709 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:01:59,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:01:59,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1679407704, now seen corresponding path program 1 times [2018-10-27 04:01:59,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:01:59,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:01:59,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:01:59,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:01:59,790 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:01:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:01:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:01:59,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:01:59,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:01:59,946 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:01:59,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 04:01:59,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 04:01:59,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 04:01:59,972 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-10-27 04:02:00,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:00,003 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-10-27 04:02:00,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 04:02:00,005 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-10-27 04:02:00,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:00,020 INFO L225 Difference]: With dead ends: 44 [2018-10-27 04:02:00,021 INFO L226 Difference]: Without dead ends: 21 [2018-10-27 04:02:00,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 04:02:00,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-27 04:02:00,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-27 04:02:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-27 04:02:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-10-27 04:02:00,080 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2018-10-27 04:02:00,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:00,081 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-10-27 04:02:00,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 04:02:00,081 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-10-27 04:02:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 04:02:00,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:00,083 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] [2018-10-27 04:02:00,083 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:00,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:00,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1597240285, now seen corresponding path program 1 times [2018-10-27 04:02:00,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:00,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:00,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:00,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:00,087 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:00,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:02:00,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:02:00,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 04:02:00,566 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:02:00,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:02:00,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:02:00,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:02:00,569 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 6 states. [2018-10-27 04:02:00,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:00,692 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-10-27 04:02:00,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:02:00,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-10-27 04:02:00,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:00,696 INFO L225 Difference]: With dead ends: 29 [2018-10-27 04:02:00,696 INFO L226 Difference]: Without dead ends: 21 [2018-10-27 04:02:00,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:02:00,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-27 04:02:00,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-27 04:02:00,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-27 04:02:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-10-27 04:02:00,706 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 20 [2018-10-27 04:02:00,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:00,707 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-10-27 04:02:00,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:02:00,707 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-10-27 04:02:00,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 04:02:00,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:00,708 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] [2018-10-27 04:02:00,708 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:00,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:00,709 INFO L82 PathProgramCache]: Analyzing trace with hash 145570050, now seen corresponding path program 1 times [2018-10-27 04:02:00,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:00,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:00,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:00,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:00,712 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:01,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:02:01,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:02:01,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:02:01,032 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:02:01,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:02:01,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:02:01,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:02:01,034 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-10-27 04:02:01,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:01,298 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-10-27 04:02:01,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:02:01,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-27 04:02:01,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:01,300 INFO L225 Difference]: With dead ends: 34 [2018-10-27 04:02:01,300 INFO L226 Difference]: Without dead ends: 25 [2018-10-27 04:02:01,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:02:01,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-27 04:02:01,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-27 04:02:01,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-27 04:02:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-10-27 04:02:01,310 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2018-10-27 04:02:01,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:01,310 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-10-27 04:02:01,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:02:01,311 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-10-27 04:02:01,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-27 04:02:01,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:01,312 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] [2018-10-27 04:02:01,313 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:01,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:01,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1819847252, now seen corresponding path program 1 times [2018-10-27 04:02:01,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:01,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:01,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:01,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:01,316 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:02:01,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:01,713 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:02:01,714 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-27 04:02:01,717 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [17], [19], [26], [27], [31], [33], [37], [40], [42], [48], [49], [50], [52], [53], [54] [2018-10-27 04:02:01,809 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:02:01,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:02:02,065 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:02:06,500 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:02:06,503 INFO L272 AbstractInterpreter]: Visited 21 different actions 269 times. Merged at 7 different actions 217 times. Widened at 1 different actions 27 times. Found 32 fixpoints after 2 different actions. Largest state had 29 variables. [2018-10-27 04:02:06,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:06,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:02:06,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:06,551 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 04:02:06,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:06,566 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:02:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:06,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:02:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:02:07,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:02:07,405 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-10-27 04:02:07,950 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-27 04:02:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:02:08,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:02:08,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2018-10-27 04:02:08,465 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:02:08,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 04:02:08,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 04:02:08,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-10-27 04:02:08,468 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 10 states. [2018-10-27 04:02:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:09,059 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-10-27 04:02:09,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:02:09,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-10-27 04:02:09,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:09,064 INFO L225 Difference]: With dead ends: 43 [2018-10-27 04:02:09,064 INFO L226 Difference]: Without dead ends: 34 [2018-10-27 04:02:09,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-10-27 04:02:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-27 04:02:09,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2018-10-27 04:02:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-27 04:02:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-10-27 04:02:09,074 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 24 [2018-10-27 04:02:09,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:09,075 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-10-27 04:02:09,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 04:02:09,075 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-10-27 04:02:09,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-27 04:02:09,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:09,076 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] [2018-10-27 04:02:09,077 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:09,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:09,077 INFO L82 PathProgramCache]: Analyzing trace with hash 2082093034, now seen corresponding path program 1 times [2018-10-27 04:02:09,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:09,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:09,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:09,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:09,079 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:09,903 WARN L179 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 27 [2018-10-27 04:02:10,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:02:10,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:10,196 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:02:10,196 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-27 04:02:10,196 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [13], [17], [19], [26], [27], [31], [33], [37], [40], [42], [48], [49], [50], [52], [53], [54] [2018-10-27 04:02:10,199 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 04:02:10,200 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 04:02:10,213 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 04:02:13,616 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 04:02:13,617 INFO L272 AbstractInterpreter]: Visited 22 different actions 329 times. Merged at 8 different actions 239 times. Widened at 1 different actions 28 times. Found 70 fixpoints after 4 different actions. Largest state had 29 variables. [2018-10-27 04:02:13,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:13,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 04:02:13,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:13,639 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 04:02:13,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:13,649 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:02:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:13,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:02:13,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-10-27 04:02:13,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 04:02:13,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:13,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:13,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-10-27 04:02:13,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 04:02:13,739 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:13,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:15,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:15,773 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:17 [2018-10-27 04:02:16,386 WARN L179 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-27 04:02:17,515 WARN L179 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 33 [2018-10-27 04:02:17,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:02:17,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:02:17,750 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-10-27 04:02:18,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:02:18,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:02:18,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 24 [2018-10-27 04:02:18,684 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:02:18,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 04:02:18,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 04:02:18,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2018-10-27 04:02:18,686 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 16 states. [2018-10-27 04:02:19,810 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-10-27 04:02:20,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:20,195 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-10-27 04:02:20,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:02:20,196 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-10-27 04:02:20,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:20,199 INFO L225 Difference]: With dead ends: 48 [2018-10-27 04:02:20,199 INFO L226 Difference]: Without dead ends: 36 [2018-10-27 04:02:20,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2018-10-27 04:02:20,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-27 04:02:20,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2018-10-27 04:02:20,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-27 04:02:20,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-10-27 04:02:20,209 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 24 [2018-10-27 04:02:20,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:20,210 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-10-27 04:02:20,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 04:02:20,210 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-10-27 04:02:20,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 04:02:20,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:20,211 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:02:20,212 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:20,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:20,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1253110442, now seen corresponding path program 2 times [2018-10-27 04:02:20,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:20,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:20,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:20,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:20,214 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:02:20,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:20,586 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:02:20,587 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:02:20,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:02:20,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:20,587 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 04:02:20,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:02:20,610 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:02:20,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-27 04:02:20,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:02:20,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:02:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-27 04:02:20,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:02:21,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-27 04:02:21,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:02:21,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 17 [2018-10-27 04:02:21,254 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:02:21,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 04:02:21,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 04:02:21,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-10-27 04:02:21,256 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 13 states. [2018-10-27 04:02:21,859 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2018-10-27 04:02:22,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:22,751 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-10-27 04:02:22,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 04:02:22,751 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-10-27 04:02:22,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:22,752 INFO L225 Difference]: With dead ends: 52 [2018-10-27 04:02:22,752 INFO L226 Difference]: Without dead ends: 40 [2018-10-27 04:02:22,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2018-10-27 04:02:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-27 04:02:22,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2018-10-27 04:02:22,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-27 04:02:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-10-27 04:02:22,760 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 28 [2018-10-27 04:02:22,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:22,761 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-10-27 04:02:22,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 04:02:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-10-27 04:02:22,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 04:02:22,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:22,762 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:02:22,762 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:22,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:22,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1646137452, now seen corresponding path program 2 times [2018-10-27 04:02:22,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:22,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:22,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:02:22,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:22,765 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:23,261 WARN L179 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 24 [2018-10-27 04:02:23,679 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2018-10-27 04:02:23,828 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2018-10-27 04:02:23,949 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2018-10-27 04:02:26,384 WARN L179 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 79 DAG size of output: 41 [2018-10-27 04:02:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:02:26,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:26,395 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:02:26,395 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:02:26,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:02:26,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:26,396 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 04:02:26,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:02:26,412 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:02:26,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 04:02:26,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:02:26,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:02:26,489 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-10-27 04:02:26,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 04:02:26,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:26,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:26,632 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-10-27 04:02:26,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 04:02:26,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:26,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:28,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:28,725 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-10-27 04:02:29,483 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-10-27 04:02:29,746 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2018-10-27 04:02:29,966 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 04:02:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:02:30,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:02:30,525 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2018-10-27 04:02:32,100 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2018-10-27 04:02:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:02:32,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:02:32,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 33 [2018-10-27 04:02:32,150 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:02:32,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-27 04:02:32,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 04:02:32,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2018-10-27 04:02:32,158 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 22 states. [2018-10-27 04:02:32,569 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-10-27 04:02:32,779 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-10-27 04:02:33,349 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2018-10-27 04:02:33,542 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2018-10-27 04:02:33,893 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 70 [2018-10-27 04:02:34,215 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 95 [2018-10-27 04:02:34,732 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2018-10-27 04:02:34,951 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2018-10-27 04:02:35,382 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 80 [2018-10-27 04:02:35,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:35,444 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-10-27 04:02:35,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 04:02:35,445 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-10-27 04:02:35,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:35,447 INFO L225 Difference]: With dead ends: 59 [2018-10-27 04:02:35,447 INFO L226 Difference]: Without dead ends: 47 [2018-10-27 04:02:35,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=281, Invalid=1975, Unknown=0, NotChecked=0, Total=2256 [2018-10-27 04:02:35,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-27 04:02:35,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2018-10-27 04:02:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-27 04:02:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-10-27 04:02:35,457 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2018-10-27 04:02:35,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:35,458 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-10-27 04:02:35,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-27 04:02:35,458 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-10-27 04:02:35,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 04:02:35,459 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:35,459 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:02:35,459 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:35,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:35,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1637712594, now seen corresponding path program 3 times [2018-10-27 04:02:35,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:35,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:35,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:02:35,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:35,462 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 04:02:35,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:02:35,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:02:35,543 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 04:02:35,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:02:35,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:02:35,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:02:35,545 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-10-27 04:02:35,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:35,617 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-10-27 04:02:35,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:02:35,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-27 04:02:35,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:35,618 INFO L225 Difference]: With dead ends: 56 [2018-10-27 04:02:35,619 INFO L226 Difference]: Without dead ends: 33 [2018-10-27 04:02:35,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:02:35,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-27 04:02:35,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-27 04:02:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-27 04:02:35,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-27 04:02:35,627 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-10-27 04:02:35,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:35,627 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-27 04:02:35,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:02:35,628 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-27 04:02:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 04:02:35,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:35,629 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:02:35,629 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:35,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:35,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1605254594, now seen corresponding path program 4 times [2018-10-27 04:02:35,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:35,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:35,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:02:35,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:35,631 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:36,043 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 35 [2018-10-27 04:02:36,189 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 20 [2018-10-27 04:02:36,362 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 32 [2018-10-27 04:02:36,601 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2018-10-27 04:02:37,002 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2018-10-27 04:02:39,900 WARN L179 SmtUtils]: Spent 2.30 s on a formula simplification that was a NOOP. DAG size: 50 [2018-10-27 04:02:42,292 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 35 [2018-10-27 04:02:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:02:42,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:42,300 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:02:42,300 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:02:42,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:02:42,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:02:42,300 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:02:42,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:42,310 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 04:02:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:42,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:02:42,404 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-10-27 04:02:42,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 04:02:42,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:42,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:42,450 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-10-27 04:02:42,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 04:02:42,453 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:02:42,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:48,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:02:48,527 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-10-27 04:02:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:02:49,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:02:49,743 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2018-10-27 04:02:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:02:51,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:02:51,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 30 [2018-10-27 04:02:51,119 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:02:51,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-27 04:02:51,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 04:02:51,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=779, Unknown=1, NotChecked=0, Total=870 [2018-10-27 04:02:51,123 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 22 states. [2018-10-27 04:02:51,586 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-10-27 04:02:51,950 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2018-10-27 04:02:52,343 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2018-10-27 04:02:52,627 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2018-10-27 04:02:53,128 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2018-10-27 04:02:53,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:02:53,738 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-27 04:02:53,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 04:02:53,739 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2018-10-27 04:02:53,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:02:53,741 INFO L225 Difference]: With dead ends: 48 [2018-10-27 04:02:53,741 INFO L226 Difference]: Without dead ends: 38 [2018-10-27 04:02:53,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=211, Invalid=1594, Unknown=1, NotChecked=0, Total=1806 [2018-10-27 04:02:53,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-27 04:02:53,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-10-27 04:02:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-27 04:02:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-27 04:02:53,750 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-10-27 04:02:53,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:02:53,751 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-27 04:02:53,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-27 04:02:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-27 04:02:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 04:02:53,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:02:53,752 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:02:53,753 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:02:53,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:02:53,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1810116584, now seen corresponding path program 5 times [2018-10-27 04:02:53,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:02:53,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:53,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:02:53,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:02:53,754 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:02:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:02:54,903 WARN L179 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 34 [2018-10-27 04:02:55,687 WARN L179 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2018-10-27 04:02:56,008 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 68 [2018-10-27 04:02:56,506 WARN L179 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 48 [2018-10-27 04:02:56,747 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2018-10-27 04:03:08,043 WARN L179 SmtUtils]: Spent 9.05 s on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2018-10-27 04:03:32,774 WARN L179 SmtUtils]: Spent 22.04 s on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2018-10-27 04:03:35,274 WARN L179 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 100 DAG size of output: 52 [2018-10-27 04:03:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:03:35,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:03:35,288 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:03:35,288 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:03:35,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:03:35,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:03:35,289 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/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-10-27 04:03:35,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:03:35,297 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 04:03:42,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-27 04:03:42,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:03:42,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:03:42,077 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 04:03:42,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:50,132 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-10-27 04:03:50,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 04:03:50,136 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 04:03:50,138 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:50,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:03:50,144 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-10-27 04:03:51,992 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-10-27 04:03:59,296 WARN L179 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-10-27 04:04:00,277 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-10-27 04:04:00,440 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:04:00,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:04:00,880 WARN L179 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 109 [2018-10-27 04:04:01,078 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2018-10-27 04:04:02,689 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-10-27 04:04:03,077 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-10-27 04:04:03,736 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-10-27 04:04:04,241 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-10-27 04:04:04,816 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-10-27 04:04:05,480 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-10-27 04:04:06,086 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-10-27 04:04:06,858 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-10-27 04:04:08,929 WARN L179 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2018-10-27 04:04:10,013 WARN L179 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-10-27 04:04:12,000 WARN L179 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-10-27 04:04:12,039 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:04:12,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:04:12,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 17] total 45 [2018-10-27 04:04:12,060 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:04:12,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-27 04:04:12,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-27 04:04:12,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1771, Unknown=5, NotChecked=0, Total=1980 [2018-10-27 04:04:12,062 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 30 states. [2018-10-27 04:04:15,824 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 79 [2018-10-27 04:04:16,708 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 67 [2018-10-27 04:04:16,898 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2018-10-27 04:04:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:04:17,307 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-27 04:04:17,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 04:04:17,313 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2018-10-27 04:04:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:04:17,314 INFO L225 Difference]: With dead ends: 52 [2018-10-27 04:04:17,314 INFO L226 Difference]: Without dead ends: 42 [2018-10-27 04:04:17,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 64.2s TimeCoverageRelationStatistics Valid=306, Invalid=2239, Unknown=5, NotChecked=0, Total=2550 [2018-10-27 04:04:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-27 04:04:17,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-10-27 04:04:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-27 04:04:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-27 04:04:17,329 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-10-27 04:04:17,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:04:17,329 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-27 04:04:17,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-27 04:04:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-27 04:04:17,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-27 04:04:17,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:04:17,331 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:04:17,334 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 04:04:17,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:04:17,334 INFO L82 PathProgramCache]: Analyzing trace with hash 668186770, now seen corresponding path program 6 times [2018-10-27 04:04:17,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 04:04:17,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:04:17,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:04:17,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:04:17,336 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 04:04:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:04:18,549 WARN L179 SmtUtils]: Spent 942.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 34 [2018-10-27 04:04:18,739 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2018-10-27 04:04:18,860 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-10-27 04:04:19,000 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 36 [2018-10-27 04:04:19,270 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2018-10-27 04:04:19,548 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2018-10-27 04:04:21,737 WARN L179 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2018-10-27 04:04:22,274 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2018-10-27 04:04:22,538 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 70 [2018-10-27 04:04:22,884 WARN L179 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2018-10-27 04:04:23,310 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2018-10-27 04:04:25,739 WARN L179 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2018-10-27 04:04:25,907 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2018-10-27 04:04:28,448 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_linear_search_~j~0 4294967296))) (let ((.cse1 (+ .cse0 1))) (and (or (<= 0 .cse0) (< 0 .cse1)) (let ((.cse2 (<= .cse1 0))) (or (and (<= c_linear_search_~j~0 5) (or (not (= 0 |c_linear_search_#in~a.offset|)) .cse2 (let ((.cse7 (- |c_linear_search_#in~n|))) (let ((.cse4 (- .cse7))) (let ((.cse3 (div (+ .cse4 (- 4)) 4294967296))) (let ((.cse6 (div (+ c_linear_search_~j~0 (+ (* 2 .cse7) (+ (* 12884901888 (div (+ .cse4 4294967281) 4294967296)) (+ (* (- 4294967296) .cse3) 8589934592)))) 8589934592))) (let ((.cse5 (* 17179869184 .cse6))) (and (<= |c_linear_search_#in~n| (+ (* 4294967296 (div (+ (- c_linear_search_~j~0) (+ (* 4294967296 .cse3) 5)) 4294967296)) 14)) (<= |c_linear_search_#in~n| (+ (* 4294967296 (div (+ .cse4 (- 5)) 4294967296)) 14)) (<= .cse5 0) (or (<= (+ .cse5 1) 0) (not (= (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (- (+ (* (- 17179869184) .cse6) (- 8)))) |c_linear_search_#in~q|))) (<= (+ (* 4294967296 (div (+ (* 4294967296 .cse0) (+ .cse4 4294967290)) 4294967296)) 4) |c_linear_search_#in~n|))))))))) |c_linear_search_#t~short1| .cse2))))) is different from false [2018-10-27 04:05:15,529 WARN L179 SmtUtils]: Spent 36.00 s on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2018-10-27 04:05:18,023 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 41 [2018-10-27 04:05:18,042 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-10-27 04:05:18,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:05:18,042 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 04:05:18,042 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 04:05:18,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 04:05:18,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:05:18,043 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/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-10-27 04:05:18,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 04:05:18,053 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 04:05:18,154 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 04:05:18,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:05:18,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:05:18,176 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-10-27 04:05:18,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 04:05:18,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 04:05:18,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:05:18,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-10-27 04:05:18,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 04:05:18,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 04:05:18,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:05:24,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:05:24,253 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-10-27 04:05:32,636 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:05:32,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 04:05:32,936 WARN L179 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2018-10-27 04:05:34,721 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-10-27 04:05:42,070 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-10-27 04:05:42,890 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-10-27 04:05:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:05:42,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 04:05:42,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 50 [2018-10-27 04:05:42,951 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 04:05:42,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-27 04:05:42,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-27 04:05:42,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2154, Unknown=10, NotChecked=94, Total=2450 [2018-10-27 04:05:42,955 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 35 states. [2018-10-27 04:05:43,754 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2018-10-27 04:05:44,344 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2018-10-27 04:05:44,979 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-10-27 04:05:45,741 WARN L179 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 98 [2018-10-27 04:05:46,225 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-10-27 04:05:50,955 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 97 [2018-10-27 04:05:51,403 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 55 [2018-10-27 04:05:51,750 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2018-10-27 04:05:54,421 WARN L179 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 57 [2018-10-27 04:05:54,745 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 48 Received shutdown request... [2018-10-27 04:06:22,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 04:06:22,858 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 04:06:22,861 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 04:06:22,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 04:06:22 BoogieIcfgContainer [2018-10-27 04:06:22,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 04:06:22,863 INFO L168 Benchmark]: Toolchain (without parser) took 264430.40 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -987.9 MB). Peak memory consumption was 730.2 MB. Max. memory is 7.1 GB. [2018-10-27 04:06:22,863 INFO L168 Benchmark]: CDTParser took 0.22 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-10-27 04:06:22,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.76 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-10-27 04:06:22,864 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.39 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-10-27 04:06:22,865 INFO L168 Benchmark]: Boogie Preprocessor took 29.74 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-10-27 04:06:22,865 INFO L168 Benchmark]: RCFGBuilder took 647.19 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2018-10-27 04:06:22,866 INFO L168 Benchmark]: TraceAbstraction took 263289.12 ms. Allocated memory was 2.2 GB in the beginning and 3.2 GB in the end (delta: 994.6 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -232.0 MB). Peak memory consumption was 762.5 MB. Max. memory is 7.1 GB. [2018-10-27 04:06:22,872 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.22 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. * CACSL2BoogieTranslator took 412.76 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 45.39 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.74 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 647.19 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 263289.12 ms. Allocated memory was 2.2 GB in the beginning and 3.2 GB in the end (delta: 994.6 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -232.0 MB). Peak memory consumption was 762.5 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 (41states) and FLOYD_HOARE automaton (currently 19 states, 35 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 66 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. TIMEOUT Result, 263.2s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 55.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 212 SDtfs, 327 SDslu, 1352 SDs, 0 SdLazy, 1911 SolverSat, 120 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 600 GetRequests, 298 SyntacticMatches, 21 SemanticMatches, 280 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 181.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 8.2s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 39 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 7.4s SatisfiabilityAnalysisTime, 191.4s InterpolantComputationTime, 509 NumberOfCodeBlocks, 501 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 696 ConstructedInterpolants, 148 QuantifiedInterpolants, 1135267 SizeOfPredicates, 143 NumberOfNonLiveVariables, 1029 ConjunctsInSsa, 334 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 28/480 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown