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/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem16_label01_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:21:41,711 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:21:41,713 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:21:41,726 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:21:41,726 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:21:41,727 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:21:41,730 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:21:41,732 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:21:41,734 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:21:41,735 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:21:41,744 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:21:41,745 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:21:41,746 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:21:41,750 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:21:41,751 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:21:41,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:21:41,753 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:21:41,754 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:21:41,756 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:21:41,759 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:21:41,761 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:21:41,762 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:21:41,767 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:21:41,769 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:21:41,769 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:21:41,770 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:21:41,771 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:21:41,772 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:21:41,774 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:21:41,775 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:21:41,775 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:21:41,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:21:41,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:21:41,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:21:41,781 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:21:41,781 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:21:41,782 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:21:41,802 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:21:41,803 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:21:41,803 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:21:41,804 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:21:41,804 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:21:41,804 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:21:41,805 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:21:41,805 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:21:41,805 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:21:41,805 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:21:41,805 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:21:41,806 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:21:41,806 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:21:41,806 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:21:41,806 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:21:41,806 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:21:41,807 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:21:41,807 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:21:41,807 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:21:41,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:21:41,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:21:41,808 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:21:41,808 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:21:41,808 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:21:41,808 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:21:41,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:21:41,808 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:21:41,809 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:21:41,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:21:41,885 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:21:41,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:21:41,892 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:21:41,893 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:21:41,893 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label01_false-unreach-call.c [2018-10-24 14:21:41,957 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1930070b3/10d703d9d7d74e8997461f5164d5eba0/FLAG8b70db717 [2018-10-24 14:21:42,587 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:21:42,587 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label01_false-unreach-call.c [2018-10-24 14:21:42,608 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1930070b3/10d703d9d7d74e8997461f5164d5eba0/FLAG8b70db717 [2018-10-24 14:21:42,628 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1930070b3/10d703d9d7d74e8997461f5164d5eba0 [2018-10-24 14:21:42,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:21:42,642 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:21:42,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:21:42,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:21:42,647 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:21:42,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:21:42" (1/1) ... [2018-10-24 14:21:42,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac71435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:21:42, skipping insertion in model container [2018-10-24 14:21:42,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:21:42" (1/1) ... [2018-10-24 14:21:42,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:21:42,743 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:21:43,450 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:21:43,455 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:21:43,707 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:21:43,727 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:21:43,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:21:43 WrapperNode [2018-10-24 14:21:43,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:21:43,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:21:43,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:21:43,730 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:21:43,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:21:43" (1/1) ... [2018-10-24 14:21:43,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:21:43" (1/1) ... [2018-10-24 14:21:44,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:21:44,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:21:44,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:21:44,051 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:21:44,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:21:43" (1/1) ... [2018-10-24 14:21:44,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:21:43" (1/1) ... [2018-10-24 14:21:44,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:21:43" (1/1) ... [2018-10-24 14:21:44,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:21:43" (1/1) ... [2018-10-24 14:21:44,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:21:43" (1/1) ... [2018-10-24 14:21:44,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:21:43" (1/1) ... [2018-10-24 14:21:44,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:21:43" (1/1) ... [2018-10-24 14:21:44,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:21:44,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:21:44,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:21:44,217 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:21:44,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:21:43" (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-24 14:21:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:21:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:21:44,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:21:51,036 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:21:51,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:21:51 BoogieIcfgContainer [2018-10-24 14:21:51,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:21:51,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:21:51,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:21:51,043 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:21:51,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:21:42" (1/3) ... [2018-10-24 14:21:51,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f8d5eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:21:51, skipping insertion in model container [2018-10-24 14:21:51,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:21:43" (2/3) ... [2018-10-24 14:21:51,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f8d5eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:21:51, skipping insertion in model container [2018-10-24 14:21:51,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:21:51" (3/3) ... [2018-10-24 14:21:51,047 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label01_false-unreach-call.c [2018-10-24 14:21:51,058 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:21:51,067 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:21:51,086 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:21:51,128 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:21:51,129 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:21:51,129 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:21:51,129 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:21:51,130 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:21:51,130 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:21:51,130 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:21:51,130 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:21:51,130 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:21:51,160 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states. [2018-10-24 14:21:51,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-24 14:21:51,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:21:51,169 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:21:51,172 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:21:51,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:21:51,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1740446778, now seen corresponding path program 1 times [2018-10-24 14:21:51,180 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:21:51,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:21:51,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:21:51,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:21:51,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:21:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:21:51,581 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 14:21:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:21:51,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:21:51,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:21:51,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:21:51,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:21:51,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:21:51,626 INFO L87 Difference]: Start difference. First operand 397 states. Second operand 4 states. [2018-10-24 14:21:58,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:21:58,681 INFO L93 Difference]: Finished difference Result 1458 states and 2766 transitions. [2018-10-24 14:21:58,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:21:58,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-10-24 14:21:58,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:21:58,736 INFO L225 Difference]: With dead ends: 1458 [2018-10-24 14:21:58,737 INFO L226 Difference]: Without dead ends: 1054 [2018-10-24 14:21:58,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:21:58,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2018-10-24 14:21:58,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1054. [2018-10-24 14:21:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2018-10-24 14:21:58,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1744 transitions. [2018-10-24 14:21:58,922 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1744 transitions. Word has length 27 [2018-10-24 14:21:58,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:21:58,923 INFO L481 AbstractCegarLoop]: Abstraction has 1054 states and 1744 transitions. [2018-10-24 14:21:58,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:21:58,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1744 transitions. [2018-10-24 14:21:58,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-24 14:21:58,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:21:58,931 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:21:58,931 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:21:58,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:21:58,933 INFO L82 PathProgramCache]: Analyzing trace with hash 2021507458, now seen corresponding path program 1 times [2018-10-24 14:21:58,933 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:21:58,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:21:58,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:21:58,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:21:58,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:21:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:21:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:21:59,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:21:59,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:21:59,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:21:59,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:21:59,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:21:59,230 INFO L87 Difference]: Start difference. First operand 1054 states and 1744 transitions. Second operand 4 states. [2018-10-24 14:22:04,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:22:04,874 INFO L93 Difference]: Finished difference Result 4101 states and 6863 transitions. [2018-10-24 14:22:04,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:22:04,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-10-24 14:22:04,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:22:04,898 INFO L225 Difference]: With dead ends: 4101 [2018-10-24 14:22:04,898 INFO L226 Difference]: Without dead ends: 3049 [2018-10-24 14:22:04,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:22:04,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2018-10-24 14:22:04,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 2044. [2018-10-24 14:22:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2018-10-24 14:22:04,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 3225 transitions. [2018-10-24 14:22:04,960 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 3225 transitions. Word has length 99 [2018-10-24 14:22:04,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:22:04,961 INFO L481 AbstractCegarLoop]: Abstraction has 2044 states and 3225 transitions. [2018-10-24 14:22:04,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:22:04,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 3225 transitions. [2018-10-24 14:22:04,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-24 14:22:04,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:22:04,977 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:22:04,977 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:22:04,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:22:04,978 INFO L82 PathProgramCache]: Analyzing trace with hash -183471256, now seen corresponding path program 1 times [2018-10-24 14:22:04,978 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:22:04,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:22:04,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:22:04,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:22:04,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:22:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:22:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-24 14:22:05,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:22:05,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:22:05,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:22:05,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:22:05,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:22:05,272 INFO L87 Difference]: Start difference. First operand 2044 states and 3225 transitions. Second operand 4 states. [2018-10-24 14:22:11,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:22:11,327 INFO L93 Difference]: Finished difference Result 5076 states and 7873 transitions. [2018-10-24 14:22:11,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:22:11,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-10-24 14:22:11,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:22:11,347 INFO L225 Difference]: With dead ends: 5076 [2018-10-24 14:22:11,347 INFO L226 Difference]: Without dead ends: 3034 [2018-10-24 14:22:11,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:22:11,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3034 states. [2018-10-24 14:22:11,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3034 to 3034. [2018-10-24 14:22:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3034 states. [2018-10-24 14:22:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 4326 transitions. [2018-10-24 14:22:11,413 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 4326 transitions. Word has length 183 [2018-10-24 14:22:11,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:22:11,413 INFO L481 AbstractCegarLoop]: Abstraction has 3034 states and 4326 transitions. [2018-10-24 14:22:11,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:22:11,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 4326 transitions. [2018-10-24 14:22:11,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-24 14:22:11,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:22:11,419 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:22:11,419 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:22:11,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:22:11,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1718720518, now seen corresponding path program 1 times [2018-10-24 14:22:11,420 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:22:11,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:22:11,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:22:11,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:22:11,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:22:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:22:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-24 14:22:11,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:22:11,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:22:11,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:22:11,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:22:11,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:22:11,643 INFO L87 Difference]: Start difference. First operand 3034 states and 4326 transitions. Second operand 3 states. [2018-10-24 14:22:15,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:22:15,123 INFO L93 Difference]: Finished difference Result 7386 states and 10730 transitions. [2018-10-24 14:22:15,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:22:15,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2018-10-24 14:22:15,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:22:15,146 INFO L225 Difference]: With dead ends: 7386 [2018-10-24 14:22:15,146 INFO L226 Difference]: Without dead ends: 4354 [2018-10-24 14:22:15,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:22:15,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4354 states. [2018-10-24 14:22:15,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4354 to 4354. [2018-10-24 14:22:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4354 states. [2018-10-24 14:22:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4354 states to 4354 states and 5878 transitions. [2018-10-24 14:22:15,233 INFO L78 Accepts]: Start accepts. Automaton has 4354 states and 5878 transitions. Word has length 195 [2018-10-24 14:22:15,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:22:15,234 INFO L481 AbstractCegarLoop]: Abstraction has 4354 states and 5878 transitions. [2018-10-24 14:22:15,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:22:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand 4354 states and 5878 transitions. [2018-10-24 14:22:15,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-24 14:22:15,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:22:15,239 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:22:15,239 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:22:15,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:22:15,239 INFO L82 PathProgramCache]: Analyzing trace with hash 918300432, now seen corresponding path program 1 times [2018-10-24 14:22:15,239 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:22:15,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:22:15,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:22:15,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:22:15,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:22:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:22:15,707 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:22:15,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:22:15,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:22:15,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:22:15,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:22:15,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:22:15,709 INFO L87 Difference]: Start difference. First operand 4354 states and 5878 transitions. Second operand 4 states. [2018-10-24 14:22:19,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:22:19,649 INFO L93 Difference]: Finished difference Result 15966 states and 21694 transitions. [2018-10-24 14:22:19,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:22:19,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2018-10-24 14:22:19,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:22:19,693 INFO L225 Difference]: With dead ends: 15966 [2018-10-24 14:22:19,693 INFO L226 Difference]: Without dead ends: 11614 [2018-10-24 14:22:19,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:22:19,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11614 states. [2018-10-24 14:22:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11614 to 11614. [2018-10-24 14:22:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11614 states. [2018-10-24 14:22:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11614 states to 11614 states and 14516 transitions. [2018-10-24 14:22:19,921 INFO L78 Accepts]: Start accepts. Automaton has 11614 states and 14516 transitions. Word has length 207 [2018-10-24 14:22:19,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:22:19,922 INFO L481 AbstractCegarLoop]: Abstraction has 11614 states and 14516 transitions. [2018-10-24 14:22:19,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:22:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 11614 states and 14516 transitions. [2018-10-24 14:22:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-10-24 14:22:19,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:22:19,935 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:22:19,935 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:22:19,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:22:19,935 INFO L82 PathProgramCache]: Analyzing trace with hash 140112663, now seen corresponding path program 1 times [2018-10-24 14:22:19,936 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:22:19,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:22:19,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:22:19,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:22:19,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:22:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:22:20,420 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 14:22:20,618 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2018-10-24 14:22:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-24 14:22:21,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:22:21,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 14:22:21,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:22:21,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:22:21,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:22:21,152 INFO L87 Difference]: Start difference. First operand 11614 states and 14516 transitions. Second operand 7 states. [2018-10-24 14:22:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:22:25,710 INFO L93 Difference]: Finished difference Result 23567 states and 29384 transitions. [2018-10-24 14:22:25,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:22:25,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 381 [2018-10-24 14:22:25,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:22:25,746 INFO L225 Difference]: With dead ends: 23567 [2018-10-24 14:22:25,747 INFO L226 Difference]: Without dead ends: 11955 [2018-10-24 14:22:25,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:22:25,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11955 states. [2018-10-24 14:22:25,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11955 to 11944. [2018-10-24 14:22:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11944 states. [2018-10-24 14:22:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11944 states to 11944 states and 14852 transitions. [2018-10-24 14:22:25,931 INFO L78 Accepts]: Start accepts. Automaton has 11944 states and 14852 transitions. Word has length 381 [2018-10-24 14:22:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:22:25,931 INFO L481 AbstractCegarLoop]: Abstraction has 11944 states and 14852 transitions. [2018-10-24 14:22:25,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:22:25,932 INFO L276 IsEmpty]: Start isEmpty. Operand 11944 states and 14852 transitions. [2018-10-24 14:22:25,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-10-24 14:22:25,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:22:25,943 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:22:25,943 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:22:25,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:22:25,944 INFO L82 PathProgramCache]: Analyzing trace with hash -469753230, now seen corresponding path program 1 times [2018-10-24 14:22:25,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:22:25,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:22:25,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:22:25,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:22:25,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:22:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:22:26,902 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-10-24 14:22:26,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:22:26,902 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-24 14:22:26,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:22:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:22:27,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:22:27,748 WARN L179 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 23 [2018-10-24 14:22:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 203 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:22:28,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 14:22:28,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-24 14:22:28,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 14:22:28,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 14:22:28,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:22:28,667 INFO L87 Difference]: Start difference. First operand 11944 states and 14852 transitions. Second operand 8 states. [2018-10-24 14:22:45,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:22:45,481 INFO L93 Difference]: Finished difference Result 35798 states and 43591 transitions. [2018-10-24 14:22:45,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 14:22:45,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 443 [2018-10-24 14:22:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:22:45,524 INFO L225 Difference]: With dead ends: 35798 [2018-10-24 14:22:45,525 INFO L226 Difference]: Without dead ends: 24186 [2018-10-24 14:22:45,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:22:45,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24186 states. [2018-10-24 14:22:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24186 to 22202. [2018-10-24 14:22:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22202 states. [2018-10-24 14:22:45,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22202 states to 22202 states and 26472 transitions. [2018-10-24 14:22:45,962 INFO L78 Accepts]: Start accepts. Automaton has 22202 states and 26472 transitions. Word has length 443 [2018-10-24 14:22:45,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:22:45,963 INFO L481 AbstractCegarLoop]: Abstraction has 22202 states and 26472 transitions. [2018-10-24 14:22:45,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 14:22:45,963 INFO L276 IsEmpty]: Start isEmpty. Operand 22202 states and 26472 transitions. [2018-10-24 14:22:45,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-10-24 14:22:45,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:22:45,979 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:22:45,980 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:22:45,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:22:45,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1923592839, now seen corresponding path program 1 times [2018-10-24 14:22:45,980 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:22:45,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:22:45,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:22:45,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:22:45,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:22:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:22:46,370 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 14:22:46,615 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-24 14:22:46,933 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-24 14:22:47,297 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-10-24 14:22:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-24 14:22:47,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:22:47,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 14:22:47,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:22:47,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:22:47,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:22:47,594 INFO L87 Difference]: Start difference. First operand 22202 states and 26472 transitions. Second operand 7 states. [2018-10-24 14:22:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:22:52,925 INFO L93 Difference]: Finished difference Result 44042 states and 52582 transitions. [2018-10-24 14:22:52,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 14:22:52,926 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 469 [2018-10-24 14:22:52,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:22:52,966 INFO L225 Difference]: With dead ends: 44042 [2018-10-24 14:22:52,966 INFO L226 Difference]: Without dead ends: 20263 [2018-10-24 14:22:52,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:22:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20263 states. [2018-10-24 14:22:53,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20263 to 20243. [2018-10-24 14:22:53,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20243 states. [2018-10-24 14:22:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20243 states to 20243 states and 22395 transitions. [2018-10-24 14:22:53,314 INFO L78 Accepts]: Start accepts. Automaton has 20243 states and 22395 transitions. Word has length 469 [2018-10-24 14:22:53,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:22:53,315 INFO L481 AbstractCegarLoop]: Abstraction has 20243 states and 22395 transitions. [2018-10-24 14:22:53,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:22:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand 20243 states and 22395 transitions. [2018-10-24 14:22:53,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-10-24 14:22:53,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:22:53,336 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:22:53,336 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:22:53,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:22:53,337 INFO L82 PathProgramCache]: Analyzing trace with hash -469351966, now seen corresponding path program 1 times [2018-10-24 14:22:53,337 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:22:53,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:22:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:22:53,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:22:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:22:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:22:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-24 14:22:54,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:22:54,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:22:54,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:22:54,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:22:54,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:22:54,076 INFO L87 Difference]: Start difference. First operand 20243 states and 22395 transitions. Second operand 4 states. [2018-10-24 14:22:57,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:22:57,604 INFO L93 Difference]: Finished difference Result 46753 states and 51833 transitions. [2018-10-24 14:22:57,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:22:57,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 531 [2018-10-24 14:22:57,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:22:57,641 INFO L225 Difference]: With dead ends: 46753 [2018-10-24 14:22:57,641 INFO L226 Difference]: Without dead ends: 26842 [2018-10-24 14:22:57,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:22:57,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26842 states. [2018-10-24 14:22:57,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26842 to 26842. [2018-10-24 14:22:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26842 states. [2018-10-24 14:22:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26842 states to 26842 states and 28921 transitions. [2018-10-24 14:22:57,989 INFO L78 Accepts]: Start accepts. Automaton has 26842 states and 28921 transitions. Word has length 531 [2018-10-24 14:22:57,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:22:57,992 INFO L481 AbstractCegarLoop]: Abstraction has 26842 states and 28921 transitions. [2018-10-24 14:22:57,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:22:57,992 INFO L276 IsEmpty]: Start isEmpty. Operand 26842 states and 28921 transitions. [2018-10-24 14:22:58,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2018-10-24 14:22:58,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:22:58,008 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:22:58,008 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:22:58,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:22:58,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1150264802, now seen corresponding path program 1 times [2018-10-24 14:22:58,009 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:22:58,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:22:58,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:22:58,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:22:58,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:22:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:22:59,458 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:22:59,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:22:59,459 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-24 14:22:59,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:22:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:22:59,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:23:01,803 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 42 DAG size of output: 17 [2018-10-24 14:23:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 267 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:23:02,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 14:23:02,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-10-24 14:23:02,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 14:23:02,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 14:23:02,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:23:02,283 INFO L87 Difference]: Start difference. First operand 26842 states and 28921 transitions. Second operand 8 states. [2018-10-24 14:23:07,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:23:07,885 INFO L93 Difference]: Finished difference Result 54062 states and 58230 transitions. [2018-10-24 14:23:07,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 14:23:07,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 540 [2018-10-24 14:23:07,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:23:07,927 INFO L225 Difference]: With dead ends: 54062 [2018-10-24 14:23:07,928 INFO L226 Difference]: Without dead ends: 27502 [2018-10-24 14:23:07,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 538 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:23:07,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27502 states. [2018-10-24 14:23:08,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27502 to 26842. [2018-10-24 14:23:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26842 states. [2018-10-24 14:23:08,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26842 states to 26842 states and 28917 transitions. [2018-10-24 14:23:08,283 INFO L78 Accepts]: Start accepts. Automaton has 26842 states and 28917 transitions. Word has length 540 [2018-10-24 14:23:08,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:23:08,285 INFO L481 AbstractCegarLoop]: Abstraction has 26842 states and 28917 transitions. [2018-10-24 14:23:08,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 14:23:08,285 INFO L276 IsEmpty]: Start isEmpty. Operand 26842 states and 28917 transitions. [2018-10-24 14:23:08,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2018-10-24 14:23:08,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:23:08,310 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:23:08,310 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:23:08,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:23:08,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1697773299, now seen corresponding path program 1 times [2018-10-24 14:23:08,311 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:23:08,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:23:08,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:23:08,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:23:08,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:23:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:23:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2018-10-24 14:23:09,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:23:09,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:23:09,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:23:09,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:23:09,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:23:09,361 INFO L87 Difference]: Start difference. First operand 26842 states and 28917 transitions. Second operand 4 states. [2018-10-24 14:23:13,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:23:13,115 INFO L93 Difference]: Finished difference Result 57972 states and 62542 transitions. [2018-10-24 14:23:13,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:23:13,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 625 [2018-10-24 14:23:13,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:23:13,153 INFO L225 Difference]: With dead ends: 57972 [2018-10-24 14:23:13,154 INFO L226 Difference]: Without dead ends: 31462 [2018-10-24 14:23:13,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:23:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31462 states. [2018-10-24 14:23:13,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31462 to 31132. [2018-10-24 14:23:13,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31132 states. [2018-10-24 14:23:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31132 states to 31132 states and 32795 transitions. [2018-10-24 14:23:13,473 INFO L78 Accepts]: Start accepts. Automaton has 31132 states and 32795 transitions. Word has length 625 [2018-10-24 14:23:13,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:23:13,474 INFO L481 AbstractCegarLoop]: Abstraction has 31132 states and 32795 transitions. [2018-10-24 14:23:13,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:23:13,475 INFO L276 IsEmpty]: Start isEmpty. Operand 31132 states and 32795 transitions. [2018-10-24 14:23:13,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-10-24 14:23:13,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:23:13,487 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:23:13,487 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:23:13,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:23:13,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1509522246, now seen corresponding path program 1 times [2018-10-24 14:23:13,488 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:23:13,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:23:13,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:23:13,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:23:13,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:23:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:23:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 396 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:23:14,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:23:14,724 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-24 14:23:14,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:23:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:23:14,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:23:18,843 WARN L179 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 490 DAG size of output: 29 [2018-10-24 14:23:19,367 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 574 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:23:19,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 14:23:19,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-10-24 14:23:19,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 14:23:19,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 14:23:19,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:23:19,390 INFO L87 Difference]: Start difference. First operand 31132 states and 32795 transitions. Second operand 8 states. [2018-10-24 14:23:30,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:23:30,204 INFO L93 Difference]: Finished difference Result 87446 states and 92396 transitions. [2018-10-24 14:23:30,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 14:23:30,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 699 [2018-10-24 14:23:30,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:23:30,260 INFO L225 Difference]: With dead ends: 87446 [2018-10-24 14:23:30,261 INFO L226 Difference]: Without dead ends: 56621 [2018-10-24 14:23:30,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 699 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-10-24 14:23:30,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56621 states. [2018-10-24 14:23:30,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56621 to 47984. [2018-10-24 14:23:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47984 states. [2018-10-24 14:23:30,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47984 states to 47984 states and 50229 transitions. [2018-10-24 14:23:30,823 INFO L78 Accepts]: Start accepts. Automaton has 47984 states and 50229 transitions. Word has length 699 [2018-10-24 14:23:30,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:23:30,824 INFO L481 AbstractCegarLoop]: Abstraction has 47984 states and 50229 transitions. [2018-10-24 14:23:30,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 14:23:30,825 INFO L276 IsEmpty]: Start isEmpty. Operand 47984 states and 50229 transitions. [2018-10-24 14:23:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2018-10-24 14:23:30,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:23:30,838 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:23:30,839 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:23:30,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:23:30,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1277818903, now seen corresponding path program 1 times [2018-10-24 14:23:30,839 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:23:30,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:23:30,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:23:30,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:23:30,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:23:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:23:31,410 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-24 14:23:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 451 proven. 14 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2018-10-24 14:23:31,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:23:31,927 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-24 14:23:31,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:23:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:23:32,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:23:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2018-10-24 14:23:33,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:23:33,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2018-10-24 14:23:33,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:23:33,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:23:33,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:23:33,415 INFO L87 Difference]: Start difference. First operand 47984 states and 50229 transitions. Second operand 7 states. [2018-10-24 14:23:40,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:23:40,281 INFO L93 Difference]: Finished difference Result 99663 states and 104286 transitions. [2018-10-24 14:23:40,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 14:23:40,281 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 713 [2018-10-24 14:23:40,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:23:40,332 INFO L225 Difference]: With dead ends: 99663 [2018-10-24 14:23:40,333 INFO L226 Difference]: Without dead ends: 50635 [2018-10-24 14:23:40,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-10-24 14:23:40,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50635 states. [2018-10-24 14:23:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50635 to 47321. [2018-10-24 14:23:40,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47321 states. [2018-10-24 14:23:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47321 states to 47321 states and 49503 transitions. [2018-10-24 14:23:40,815 INFO L78 Accepts]: Start accepts. Automaton has 47321 states and 49503 transitions. Word has length 713 [2018-10-24 14:23:40,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:23:40,816 INFO L481 AbstractCegarLoop]: Abstraction has 47321 states and 49503 transitions. [2018-10-24 14:23:40,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:23:40,816 INFO L276 IsEmpty]: Start isEmpty. Operand 47321 states and 49503 transitions. [2018-10-24 14:23:40,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2018-10-24 14:23:40,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:23:40,828 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:23:40,828 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:23:40,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:23:40,829 INFO L82 PathProgramCache]: Analyzing trace with hash 416114943, now seen corresponding path program 1 times [2018-10-24 14:23:40,829 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:23:40,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:23:40,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:23:40,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:23:40,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:23:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:23:41,558 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 14:23:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 80 proven. 516 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-24 14:23:43,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:23:43,290 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-24 14:23:43,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:23:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:23:43,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:23:44,413 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 531 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-10-24 14:23:44,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:23:44,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-24 14:23:44,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 14:23:44,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 14:23:44,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-10-24 14:23:44,438 INFO L87 Difference]: Start difference. First operand 47321 states and 49503 transitions. Second operand 12 states. [2018-10-24 14:23:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:23:51,928 INFO L93 Difference]: Finished difference Result 106591 states and 111290 transitions. [2018-10-24 14:23:51,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 14:23:51,929 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 746 [2018-10-24 14:23:51,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:23:51,987 INFO L225 Difference]: With dead ends: 106591 [2018-10-24 14:23:51,987 INFO L226 Difference]: Without dead ends: 59602 [2018-10-24 14:23:52,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 744 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-10-24 14:23:52,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59602 states. [2018-10-24 14:23:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59602 to 47722. [2018-10-24 14:23:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47722 states. [2018-10-24 14:23:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47722 states to 47722 states and 49669 transitions. [2018-10-24 14:23:52,517 INFO L78 Accepts]: Start accepts. Automaton has 47722 states and 49669 transitions. Word has length 746 [2018-10-24 14:23:52,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:23:52,518 INFO L481 AbstractCegarLoop]: Abstraction has 47722 states and 49669 transitions. [2018-10-24 14:23:52,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 14:23:52,518 INFO L276 IsEmpty]: Start isEmpty. Operand 47722 states and 49669 transitions. [2018-10-24 14:23:52,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2018-10-24 14:23:52,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:23:52,527 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:23:52,527 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:23:52,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:23:52,528 INFO L82 PathProgramCache]: Analyzing trace with hash -800105641, now seen corresponding path program 1 times [2018-10-24 14:23:52,528 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:23:52,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:23:52,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:23:52,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:23:52,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:23:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:23:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 691 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:23:54,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:23:54,510 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-24 14:23:54,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:23:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:23:54,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:23:56,316 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_~a18~0_904 Int)) (let ((.cse0 (mod v_~a18~0_904 299932))) (and (= (mod (+ .cse0 4) 5) 0) (not (= 0 .cse0)) (<= c_~a18~0 (* 5 (div (+ .cse0 134) 5))) (< v_~a18~0_904 0)))) (exists ((v_prenex_65 Int)) (let ((.cse2 (mod v_prenex_65 299932))) (let ((.cse1 (+ .cse2 134))) (and (<= c_~a18~0 (+ (* 5 (div .cse1 5)) 5)) (< v_prenex_65 0) (< .cse1 0) (not (= 0 .cse2)) (not (= (mod (+ .cse2 4) 5) 0)))))) (exists ((v_prenex_63 Int)) (let ((.cse3 (mod v_prenex_63 299932))) (let ((.cse4 (+ .cse3 300066))) (and (= 0 .cse3) (<= 0 .cse4) (<= c_~a18~0 (* 5 (div .cse4 5))))))) (exists ((v_prenex_69 Int)) (let ((.cse6 (mod v_prenex_69 299932))) (let ((.cse5 (+ .cse6 134))) (and (<= c_~a18~0 (* 5 (div .cse5 5))) (< v_prenex_69 0) (<= 0 .cse5) (not (= 0 .cse6)))))) (exists ((v_prenex_64 Int)) (let ((.cse7 (mod v_prenex_64 299932))) (and (= 0 (mod (+ .cse7 1) 5)) (= 0 .cse7) (<= c_~a18~0 (* 5 (div (+ .cse7 300066) 5)))))) (exists ((v_prenex_68 Int)) (let ((.cse8 (+ (mod v_prenex_68 299932) 300066))) (and (<= c_~a18~0 (* 5 (div .cse8 5))) (<= 0 .cse8) (<= 0 v_prenex_68)))) (exists ((v_prenex_70 Int)) (let ((.cse10 (mod v_prenex_70 299932))) (let ((.cse9 (+ .cse10 300066))) (and (< .cse9 0) (not (= 0 (mod (+ .cse10 1) 5))) (<= c_~a18~0 (+ (* 5 (div .cse9 5)) 5)) (= 0 .cse10))))) (exists ((v_prenex_67 Int)) (let ((.cse11 (mod v_prenex_67 299932))) (and (<= 0 v_prenex_67) (= 0 (mod (+ .cse11 1) 5)) (<= c_~a18~0 (* 5 (div (+ .cse11 300066) 5)))))) (exists ((v_prenex_66 Int)) (let ((.cse13 (mod v_prenex_66 299932))) (let ((.cse12 (+ .cse13 300066))) (and (< .cse12 0) (<= 0 v_prenex_66) (not (= 0 (mod (+ .cse13 1) 5))) (<= c_~a18~0 (+ (* 5 (div .cse12 5)) 5))))))) is different from true [2018-10-24 14:24:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 25 not checked. [2018-10-24 14:24:02,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 14:24:02,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2018-10-24 14:24:02,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 14:24:02,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 14:24:02,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=37, Unknown=1, NotChecked=12, Total=72 [2018-10-24 14:24:02,992 INFO L87 Difference]: Start difference. First operand 47722 states and 49669 transitions. Second operand 9 states. [2018-10-24 14:24:20,655 WARN L179 SmtUtils]: Spent 12.92 s on a formula simplification. DAG size of input: 131 DAG size of output: 18 [2018-10-24 14:24:38,178 WARN L179 SmtUtils]: Spent 13.21 s on a formula simplification. DAG size of input: 129 DAG size of output: 18 [2018-10-24 14:24:43,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:24:43,109 INFO L93 Difference]: Finished difference Result 108316 states and 112638 transitions. [2018-10-24 14:24:43,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 14:24:43,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 749 [2018-10-24 14:24:43,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:24:43,173 INFO L225 Difference]: With dead ends: 108316 [2018-10-24 14:24:43,173 INFO L226 Difference]: Without dead ends: 60875 [2018-10-24 14:24:43,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 761 GetRequests, 750 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 34.9s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=4, NotChecked=18, Total=132 [2018-10-24 14:24:43,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60875 states. [2018-10-24 14:24:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60875 to 54446. [2018-10-24 14:24:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54446 states. [2018-10-24 14:24:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54446 states to 54446 states and 56550 transitions. [2018-10-24 14:24:43,747 INFO L78 Accepts]: Start accepts. Automaton has 54446 states and 56550 transitions. Word has length 749 [2018-10-24 14:24:43,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:24:43,748 INFO L481 AbstractCegarLoop]: Abstraction has 54446 states and 56550 transitions. [2018-10-24 14:24:43,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 14:24:43,748 INFO L276 IsEmpty]: Start isEmpty. Operand 54446 states and 56550 transitions. [2018-10-24 14:24:43,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2018-10-24 14:24:43,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:24:43,759 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:24:43,760 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:24:43,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:24:43,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1153701064, now seen corresponding path program 1 times [2018-10-24 14:24:43,760 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:24:43,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:24:43,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:24:43,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:24:43,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:24:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:24:44,330 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-24 14:24:44,673 WARN L179 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-10-24 14:24:45,082 WARN L179 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2018-10-24 14:24:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 545 proven. 235 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-24 14:24:46,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:24:46,791 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP 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-24 14:24:46,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:24:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:24:46,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:24:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 780 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-24 14:24:47,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:24:47,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-24 14:24:47,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-24 14:24:47,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-24 14:24:47,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-24 14:24:47,930 INFO L87 Difference]: Start difference. First operand 54446 states and 56550 transitions. Second operand 11 states. [2018-10-24 14:25:01,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:25:01,353 INFO L93 Difference]: Finished difference Result 154115 states and 159942 transitions. [2018-10-24 14:25:01,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-24 14:25:01,353 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 813 [2018-10-24 14:25:01,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:25:01,477 INFO L225 Difference]: With dead ends: 154115 [2018-10-24 14:25:01,477 INFO L226 Difference]: Without dead ends: 100001 [2018-10-24 14:25:01,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 856 GetRequests, 827 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=229, Invalid=641, Unknown=0, NotChecked=0, Total=870 [2018-10-24 14:25:01,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100001 states. [2018-10-24 14:25:02,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100001 to 54446. [2018-10-24 14:25:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54446 states. [2018-10-24 14:25:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54446 states to 54446 states and 56500 transitions. [2018-10-24 14:25:02,333 INFO L78 Accepts]: Start accepts. Automaton has 54446 states and 56500 transitions. Word has length 813 [2018-10-24 14:25:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:25:02,334 INFO L481 AbstractCegarLoop]: Abstraction has 54446 states and 56500 transitions. [2018-10-24 14:25:02,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-24 14:25:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 54446 states and 56500 transitions. [2018-10-24 14:25:02,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2018-10-24 14:25:02,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:25:02,345 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:25:02,346 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:25:02,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:25:02,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1023008564, now seen corresponding path program 1 times [2018-10-24 14:25:02,346 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:25:02,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:25:02,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:25:02,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:25:02,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:25:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:25:03,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2018-10-24 14:25:03,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:25:03,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 14:25:03,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:25:03,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:25:03,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:25:03,389 INFO L87 Difference]: Start difference. First operand 54446 states and 56500 transitions. Second operand 5 states. [2018-10-24 14:25:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:25:06,873 INFO L93 Difference]: Finished difference Result 117948 states and 122402 transitions. [2018-10-24 14:25:06,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:25:06,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 863 [2018-10-24 14:25:06,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:25:06,940 INFO L225 Difference]: With dead ends: 117948 [2018-10-24 14:25:06,940 INFO L226 Difference]: Without dead ends: 63783 [2018-10-24 14:25:06,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:25:07,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63783 states. [2018-10-24 14:25:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63783 to 59047. [2018-10-24 14:25:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59047 states. [2018-10-24 14:25:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59047 states to 59047 states and 61188 transitions. [2018-10-24 14:25:07,539 INFO L78 Accepts]: Start accepts. Automaton has 59047 states and 61188 transitions. Word has length 863 [2018-10-24 14:25:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:25:07,539 INFO L481 AbstractCegarLoop]: Abstraction has 59047 states and 61188 transitions. [2018-10-24 14:25:07,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:25:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 59047 states and 61188 transitions. [2018-10-24 14:25:07,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 938 [2018-10-24 14:25:07,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:25:07,552 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:25:07,553 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:25:07,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:25:07,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2113205302, now seen corresponding path program 1 times [2018-10-24 14:25:07,553 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:25:07,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:25:07,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:25:07,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:25:07,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:25:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:25:08,571 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 14:25:09,340 WARN L179 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-24 14:25:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 587 proven. 385 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-10-24 14:25:10,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:25:10,904 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:25:10,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:25:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:25:11,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:25:11,431 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-10-24 14:25:13,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 972 proven. 0 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-10-24 14:25:13,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:25:13,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2018-10-24 14:25:13,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 14:25:13,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 14:25:13,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-10-24 14:25:13,301 INFO L87 Difference]: Start difference. First operand 59047 states and 61188 transitions. Second operand 12 states. [2018-10-24 14:25:20,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:25:20,905 INFO L93 Difference]: Finished difference Result 118118 states and 122403 transitions. [2018-10-24 14:25:20,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 14:25:20,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 937 [2018-10-24 14:25:20,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:25:20,963 INFO L225 Difference]: With dead ends: 118118 [2018-10-24 14:25:20,964 INFO L226 Difference]: Without dead ends: 59403 [2018-10-24 14:25:20,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 949 GetRequests, 934 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-10-24 14:25:21,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59403 states. [2018-10-24 14:25:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59403 to 57397. [2018-10-24 14:25:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57397 states. [2018-10-24 14:25:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57397 states to 57397 states and 59364 transitions. [2018-10-24 14:25:21,616 INFO L78 Accepts]: Start accepts. Automaton has 57397 states and 59364 transitions. Word has length 937 [2018-10-24 14:25:21,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:25:21,617 INFO L481 AbstractCegarLoop]: Abstraction has 57397 states and 59364 transitions. [2018-10-24 14:25:21,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 14:25:21,617 INFO L276 IsEmpty]: Start isEmpty. Operand 57397 states and 59364 transitions. [2018-10-24 14:25:21,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1047 [2018-10-24 14:25:21,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:25:21,650 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:25:21,651 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:25:21,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:25:21,651 INFO L82 PathProgramCache]: Analyzing trace with hash 707725682, now seen corresponding path program 1 times [2018-10-24 14:25:21,651 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:25:21,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:25:21,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:25:21,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:25:21,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:25:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:25:22,439 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 14:25:22,941 WARN L179 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-10-24 14:25:23,352 WARN L179 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2018-10-24 14:25:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 100 proven. 300 refuted. 0 times theorem prover too weak. 1319 trivial. 0 not checked. [2018-10-24 14:25:24,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:25:24,030 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:25:24,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:25:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:25:24,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:25:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-10-24 14:25:25,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:25:25,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-10-24 14:25:25,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 14:25:25,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 14:25:25,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:25:25,102 INFO L87 Difference]: Start difference. First operand 57397 states and 59364 transitions. Second operand 8 states. [2018-10-24 14:25:29,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:25:29,413 INFO L93 Difference]: Finished difference Result 106515 states and 110207 transitions. [2018-10-24 14:25:29,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 14:25:29,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1046 [2018-10-24 14:25:29,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:25:29,479 INFO L225 Difference]: With dead ends: 106515 [2018-10-24 14:25:29,480 INFO L226 Difference]: Without dead ends: 49450 [2018-10-24 14:25:29,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1056 GetRequests, 1047 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-10-24 14:25:29,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49450 states. [2018-10-24 14:25:30,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49450 to 46434. [2018-10-24 14:25:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46434 states. [2018-10-24 14:25:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46434 states to 46434 states and 47627 transitions. [2018-10-24 14:25:30,392 INFO L78 Accepts]: Start accepts. Automaton has 46434 states and 47627 transitions. Word has length 1046 [2018-10-24 14:25:30,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:25:30,393 INFO L481 AbstractCegarLoop]: Abstraction has 46434 states and 47627 transitions. [2018-10-24 14:25:30,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 14:25:30,393 INFO L276 IsEmpty]: Start isEmpty. Operand 46434 states and 47627 transitions. [2018-10-24 14:25:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2018-10-24 14:25:30,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:25:30,412 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:25:30,413 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:25:30,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:25:30,413 INFO L82 PathProgramCache]: Analyzing trace with hash -855400853, now seen corresponding path program 1 times [2018-10-24 14:25:30,413 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:25:30,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:25:30,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:25:30,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:25:30,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:25:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-24 14:25:31,050 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:25:31,055 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:25:31,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:25:31 BoogieIcfgContainer [2018-10-24 14:25:31,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:25:31,057 INFO L168 Benchmark]: Toolchain (without parser) took 228416.45 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -1.9 GB). Peak memory consumption was 468.5 MB. Max. memory is 7.1 GB. [2018-10-24 14:25:31,058 INFO L168 Benchmark]: CDTParser took 0.24 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-24 14:25:31,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1085.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-24 14:25:31,059 INFO L168 Benchmark]: Boogie Procedure Inliner took 320.82 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -836.9 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:25:31,060 INFO L168 Benchmark]: Boogie Preprocessor took 166.20 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:25:31,061 INFO L168 Benchmark]: RCFGBuilder took 6821.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 266.3 MB). Peak memory consumption was 266.3 MB. Max. memory is 7.1 GB. [2018-10-24 14:25:31,062 INFO L168 Benchmark]: TraceAbstraction took 220016.53 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.7 GB). Free memory was 1.9 GB in the beginning and 3.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 198.2 MB. Max. memory is 7.1 GB. [2018-10-24 14:25:31,071 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.24 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 1085.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 320.82 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -836.9 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 166.20 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6821.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 266.3 MB). Peak memory consumption was 266.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 220016.53 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.7 GB). Free memory was 1.9 GB in the beginning and 3.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 198.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 85). Cancelled while BasicCegarLoop was analyzing trace of length 1104 with TraceHistMax 7,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateComparison was comparing new predicate (quantifier-free) to 3 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 397 locations, 1 error locations. TIMEOUT Result, 219.9s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 161.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3990 SDtfs, 27684 SDslu, 4199 SDs, 0 SdLazy, 72769 SolverSat, 7837 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 106.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6855 GetRequests, 6710 SyntacticMatches, 14 SemanticMatches, 131 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 51.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59047occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 89583 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 36.2s InterpolantComputationTime, 16952 NumberOfCodeBlocks, 16952 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 16924 ConstructedInterpolants, 183 QuantifiedInterpolants, 84818616 SizeOfPredicates, 9 NumberOfNonLiveVariables, 7726 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 28 InterpolantComputations, 15 PerfectInterpolantSequences, 15683/18080 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown