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/Problem03_label02_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:53:36,706 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:53:36,709 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:53:36,726 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:53:36,726 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:53:36,727 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:53:36,729 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:53:36,732 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:53:36,741 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:53:36,742 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:53:36,744 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:53:36,745 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:53:36,746 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:53:36,749 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:53:36,750 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:53:36,753 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:53:36,755 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:53:36,758 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:53:36,761 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:53:36,763 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:53:36,764 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:53:36,766 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:53:36,770 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:53:36,770 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:53:36,771 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:53:36,772 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:53:36,772 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:53:36,773 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:53:36,778 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:53:36,779 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:53:36,779 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:53:36,780 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:53:36,780 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:53:36,780 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:53:36,781 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:53:36,782 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:53:36,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:53:36,807 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:53:36,807 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:53:36,808 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:53:36,808 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:53:36,809 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:53:36,809 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:53:36,809 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:53:36,810 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:53:36,810 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:53:36,810 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:53:36,810 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:53:36,810 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:53:36,810 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:53:36,811 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:53:36,811 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:53:36,811 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:53:36,811 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:53:36,811 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:53:36,812 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:53:36,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:53:36,812 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:53:36,812 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:53:36,812 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:53:36,812 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:53:36,813 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:53:36,813 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:53:36,813 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:53:36,813 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:53:36,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:53:36,876 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:53:36,881 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:53:36,882 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:53:36,883 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:53:36,884 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label02_true-unreach-call.c [2018-10-24 14:53:36,947 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3332c0076/525ef8bca32f4437881391f20d245586/FLAG88b7ddc4c [2018-10-24 14:53:37,612 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:53:37,613 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label02_true-unreach-call.c [2018-10-24 14:53:37,635 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3332c0076/525ef8bca32f4437881391f20d245586/FLAG88b7ddc4c [2018-10-24 14:53:37,657 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3332c0076/525ef8bca32f4437881391f20d245586 [2018-10-24 14:53:37,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:53:37,671 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:53:37,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:37,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:53:37,679 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:53:37,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b33a858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:37, skipping insertion in model container [2018-10-24 14:53:37,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:37" (1/1) ... [2018-10-24 14:53:37,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:53:37,783 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:53:38,502 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:38,508 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:53:38,779 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:38,802 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:53:38,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:38 WrapperNode [2018-10-24 14:53:38,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:38,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:38,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:53:38,804 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:53:38,814 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:53:38" (1/1) ... [2018-10-24 14:53:38,854 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:53:38" (1/1) ... [2018-10-24 14:53:39,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:39,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:53:39,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:53:39,118 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:53:39,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:38" (1/1) ... [2018-10-24 14:53:39,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:38" (1/1) ... [2018-10-24 14:53:39,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:38" (1/1) ... [2018-10-24 14:53:39,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:38" (1/1) ... [2018-10-24 14:53:39,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:38" (1/1) ... [2018-10-24 14:53:39,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:38" (1/1) ... [2018-10-24 14:53:39,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:38" (1/1) ... [2018-10-24 14:53:39,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:53:39,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:53:39,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:53:39,251 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:53:39,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:38" (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:53:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:53:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:53:39,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:53:45,532 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:53:45,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:53:45 BoogieIcfgContainer [2018-10-24 14:53:45,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:53:45,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:53:45,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:53:45,538 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:53:45,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:53:37" (1/3) ... [2018-10-24 14:53:45,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780819c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:53:45, skipping insertion in model container [2018-10-24 14:53:45,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:38" (2/3) ... [2018-10-24 14:53:45,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780819c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:53:45, skipping insertion in model container [2018-10-24 14:53:45,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:53:45" (3/3) ... [2018-10-24 14:53:45,542 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label02_true-unreach-call.c [2018-10-24 14:53:45,551 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:53:45,560 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:53:45,578 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:53:45,616 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:53:45,617 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:53:45,617 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:53:45,617 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:53:45,618 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:53:45,618 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:53:45,618 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:53:45,618 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:53:45,618 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:53:45,643 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:53:45,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-24 14:53:45,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:45,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:45,678 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:45,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:45,685 INFO L82 PathProgramCache]: Analyzing trace with hash -855367630, now seen corresponding path program 1 times [2018-10-24 14:53:45,687 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:45,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:45,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:45,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:45,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:46,773 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:53:46,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:46,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:53:46,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:53:46,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:53:46,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:53:46,801 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:53:50,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:50,044 INFO L93 Difference]: Finished difference Result 1079 states and 1933 transitions. [2018-10-24 14:53:50,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:53:50,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2018-10-24 14:53:50,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:50,089 INFO L225 Difference]: With dead ends: 1079 [2018-10-24 14:53:50,089 INFO L226 Difference]: Without dead ends: 769 [2018-10-24 14:53:50,096 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:53:50,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-10-24 14:53:50,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 513. [2018-10-24 14:53:50,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-24 14:53:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 851 transitions. [2018-10-24 14:53:50,197 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 851 transitions. Word has length 205 [2018-10-24 14:53:50,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:50,198 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 851 transitions. [2018-10-24 14:53:50,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:53:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 851 transitions. [2018-10-24 14:53:50,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-24 14:53:50,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:50,212 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:50,212 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:50,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:50,213 INFO L82 PathProgramCache]: Analyzing trace with hash -749658221, now seen corresponding path program 1 times [2018-10-24 14:53:50,213 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:50,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:50,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:50,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:50,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:53:50,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:50,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:53:50,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:53:50,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:53:50,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:50,374 INFO L87 Difference]: Start difference. First operand 513 states and 851 transitions. Second operand 3 states. [2018-10-24 14:53:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:52,221 INFO L93 Difference]: Finished difference Result 1449 states and 2462 transitions. [2018-10-24 14:53:52,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:53:52,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2018-10-24 14:53:52,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:52,229 INFO L225 Difference]: With dead ends: 1449 [2018-10-24 14:53:52,229 INFO L226 Difference]: Without dead ends: 938 [2018-10-24 14:53:52,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:52,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-10-24 14:53:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 923. [2018-10-24 14:53:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-24 14:53:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-10-24 14:53:52,271 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 214 [2018-10-24 14:53:52,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:52,271 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-10-24 14:53:52,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:53:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-10-24 14:53:52,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-24 14:53:52,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:52,277 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:52,277 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:52,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:52,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1340362635, now seen corresponding path program 1 times [2018-10-24 14:53:52,278 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:52,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:52,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:52,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:52,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:53:52,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:52,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:53:52,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:53:52,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:53:52,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:52,426 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 3 states. [2018-10-24 14:53:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:54,472 INFO L93 Difference]: Finished difference Result 1823 states and 2997 transitions. [2018-10-24 14:53:54,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:53:54,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-10-24 14:53:54,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:54,478 INFO L225 Difference]: With dead ends: 1823 [2018-10-24 14:53:54,479 INFO L226 Difference]: Without dead ends: 902 [2018-10-24 14:53:54,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2018-10-24 14:53:54,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2018-10-24 14:53:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-10-24 14:53:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1435 transitions. [2018-10-24 14:53:54,503 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1435 transitions. Word has length 219 [2018-10-24 14:53:54,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:54,503 INFO L481 AbstractCegarLoop]: Abstraction has 902 states and 1435 transitions. [2018-10-24 14:53:54,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:53:54,504 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1435 transitions. [2018-10-24 14:53:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-24 14:53:54,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:54,508 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:54,508 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:54,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:54,509 INFO L82 PathProgramCache]: Analyzing trace with hash 367372570, now seen corresponding path program 1 times [2018-10-24 14:53:54,509 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:54,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:54,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:54,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:54,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 14:53:54,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:54,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:53:54,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:53:54,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:53:54,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:53:54,675 INFO L87 Difference]: Start difference. First operand 902 states and 1435 transitions. Second operand 4 states. [2018-10-24 14:53:58,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:58,516 INFO L93 Difference]: Finished difference Result 3476 states and 5598 transitions. [2018-10-24 14:53:58,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:53:58,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2018-10-24 14:53:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:58,531 INFO L225 Difference]: With dead ends: 3476 [2018-10-24 14:53:58,531 INFO L226 Difference]: Without dead ends: 2576 [2018-10-24 14:53:58,533 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:53:58,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2018-10-24 14:53:58,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 1723. [2018-10-24 14:53:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-10-24 14:53:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2603 transitions. [2018-10-24 14:53:58,634 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2603 transitions. Word has length 221 [2018-10-24 14:53:58,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:58,635 INFO L481 AbstractCegarLoop]: Abstraction has 1723 states and 2603 transitions. [2018-10-24 14:53:58,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:53:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2603 transitions. [2018-10-24 14:53:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-24 14:53:58,642 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:58,642 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:58,642 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:58,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:58,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1340097070, now seen corresponding path program 1 times [2018-10-24 14:53:58,643 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:58,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:58,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:58,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:58,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 14:53:58,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:58,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:53:58,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:53:58,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:53:58,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:58,765 INFO L87 Difference]: Start difference. First operand 1723 states and 2603 transitions. Second operand 3 states. [2018-10-24 14:54:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:00,272 INFO L93 Difference]: Finished difference Result 5159 states and 7797 transitions. [2018-10-24 14:54:00,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:00,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2018-10-24 14:54:00,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:00,288 INFO L225 Difference]: With dead ends: 5159 [2018-10-24 14:54:00,289 INFO L226 Difference]: Without dead ends: 3438 [2018-10-24 14:54:00,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:00,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3438 states. [2018-10-24 14:54:00,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3438 to 3436. [2018-10-24 14:54:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2018-10-24 14:54:00,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 5189 transitions. [2018-10-24 14:54:00,361 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 5189 transitions. Word has length 228 [2018-10-24 14:54:00,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:00,362 INFO L481 AbstractCegarLoop]: Abstraction has 3436 states and 5189 transitions. [2018-10-24 14:54:00,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:00,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 5189 transitions. [2018-10-24 14:54:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-24 14:54:00,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:00,369 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:00,370 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:00,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:00,370 INFO L82 PathProgramCache]: Analyzing trace with hash 369040310, now seen corresponding path program 1 times [2018-10-24 14:54:00,370 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:00,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:00,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:00,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:00,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:00,899 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 14:54:00,962 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:00,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:00,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:54:00,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:54:00,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:54:00,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:00,964 INFO L87 Difference]: Start difference. First operand 3436 states and 5189 transitions. Second operand 5 states. [2018-10-24 14:54:04,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:04,027 INFO L93 Difference]: Finished difference Result 7939 states and 12127 transitions. [2018-10-24 14:54:04,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:54:04,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2018-10-24 14:54:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:04,054 INFO L225 Difference]: With dead ends: 7939 [2018-10-24 14:54:04,054 INFO L226 Difference]: Without dead ends: 4505 [2018-10-24 14:54:04,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:04,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2018-10-24 14:54:04,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 3640. [2018-10-24 14:54:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3640 states. [2018-10-24 14:54:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3640 states to 3640 states and 5424 transitions. [2018-10-24 14:54:04,136 INFO L78 Accepts]: Start accepts. Automaton has 3640 states and 5424 transitions. Word has length 245 [2018-10-24 14:54:04,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:04,137 INFO L481 AbstractCegarLoop]: Abstraction has 3640 states and 5424 transitions. [2018-10-24 14:54:04,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:54:04,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3640 states and 5424 transitions. [2018-10-24 14:54:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-24 14:54:04,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:04,145 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, 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, 1, 1, 1, 1, 1, 1] [2018-10-24 14:54:04,145 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:04,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:04,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1623988030, now seen corresponding path program 1 times [2018-10-24 14:54:04,146 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:04,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:04,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:04,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:04,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:04,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:04,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:04,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:04,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:04,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:04,399 INFO L87 Difference]: Start difference. First operand 3640 states and 5424 transitions. Second operand 3 states. [2018-10-24 14:54:05,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:05,982 INFO L93 Difference]: Finished difference Result 8933 states and 13269 transitions. [2018-10-24 14:54:05,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:05,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2018-10-24 14:54:05,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:06,002 INFO L225 Difference]: With dead ends: 8933 [2018-10-24 14:54:06,002 INFO L226 Difference]: Without dead ends: 5295 [2018-10-24 14:54:06,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2018-10-24 14:54:06,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 5293. [2018-10-24 14:54:06,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5293 states. [2018-10-24 14:54:06,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5293 states to 5293 states and 7795 transitions. [2018-10-24 14:54:06,135 INFO L78 Accepts]: Start accepts. Automaton has 5293 states and 7795 transitions. Word has length 247 [2018-10-24 14:54:06,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:06,135 INFO L481 AbstractCegarLoop]: Abstraction has 5293 states and 7795 transitions. [2018-10-24 14:54:06,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:06,135 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 7795 transitions. [2018-10-24 14:54:06,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-24 14:54:06,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:06,149 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:06,149 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:06,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:06,150 INFO L82 PathProgramCache]: Analyzing trace with hash -85762666, now seen corresponding path program 1 times [2018-10-24 14:54:06,150 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:06,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:06,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:06,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:06,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:06,675 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:06,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:54:06,676 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:54:06,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:06,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:54:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:06,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:54:06,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 14:54:06,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:54:06,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:54:06,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:54:06,980 INFO L87 Difference]: Start difference. First operand 5293 states and 7795 transitions. Second operand 7 states. [2018-10-24 14:54:13,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:13,536 INFO L93 Difference]: Finished difference Result 23061 states and 33566 transitions. [2018-10-24 14:54:13,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 14:54:13,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 255 [2018-10-24 14:54:13,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:13,600 INFO L225 Difference]: With dead ends: 23061 [2018-10-24 14:54:13,600 INFO L226 Difference]: Without dead ends: 17770 [2018-10-24 14:54:13,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:54:13,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17770 states. [2018-10-24 14:54:13,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17770 to 17766. [2018-10-24 14:54:13,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17766 states. [2018-10-24 14:54:14,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17766 states to 17766 states and 23353 transitions. [2018-10-24 14:54:14,182 INFO L78 Accepts]: Start accepts. Automaton has 17766 states and 23353 transitions. Word has length 255 [2018-10-24 14:54:14,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:14,182 INFO L481 AbstractCegarLoop]: Abstraction has 17766 states and 23353 transitions. [2018-10-24 14:54:14,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:54:14,183 INFO L276 IsEmpty]: Start isEmpty. Operand 17766 states and 23353 transitions. [2018-10-24 14:54:14,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-24 14:54:14,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:14,214 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:14,214 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:14,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:14,215 INFO L82 PathProgramCache]: Analyzing trace with hash 507809544, now seen corresponding path program 1 times [2018-10-24 14:54:14,215 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:14,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:14,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:14,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:14,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-24 14:54:14,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:14,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:14,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:14,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:14,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:14,381 INFO L87 Difference]: Start difference. First operand 17766 states and 23353 transitions. Second operand 3 states. [2018-10-24 14:54:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:16,121 INFO L93 Difference]: Finished difference Result 49401 states and 64994 transitions. [2018-10-24 14:54:16,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:16,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2018-10-24 14:54:16,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:16,177 INFO L225 Difference]: With dead ends: 49401 [2018-10-24 14:54:16,177 INFO L226 Difference]: Without dead ends: 31637 [2018-10-24 14:54:16,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:16,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31637 states. [2018-10-24 14:54:16,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31637 to 31635. [2018-10-24 14:54:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31635 states. [2018-10-24 14:54:16,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31635 states to 31635 states and 39361 transitions. [2018-10-24 14:54:16,644 INFO L78 Accepts]: Start accepts. Automaton has 31635 states and 39361 transitions. Word has length 284 [2018-10-24 14:54:16,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:16,644 INFO L481 AbstractCegarLoop]: Abstraction has 31635 states and 39361 transitions. [2018-10-24 14:54:16,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:16,644 INFO L276 IsEmpty]: Start isEmpty. Operand 31635 states and 39361 transitions. [2018-10-24 14:54:16,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-10-24 14:54:16,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:16,695 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:16,695 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:16,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:16,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1673718087, now seen corresponding path program 1 times [2018-10-24 14:54:16,696 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:16,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:16,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:16,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:16,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-24 14:54:17,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:54:17,071 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:54:17,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:17,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:54:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-24 14:54:17,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:54:17,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-24 14:54:17,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:54:17,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:54:17,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:17,418 INFO L87 Difference]: Start difference. First operand 31635 states and 39361 transitions. Second operand 5 states. [2018-10-24 14:54:20,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:20,176 INFO L93 Difference]: Finished difference Result 68576 states and 85864 transitions. [2018-10-24 14:54:20,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:20,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 297 [2018-10-24 14:54:20,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:20,221 INFO L225 Difference]: With dead ends: 68576 [2018-10-24 14:54:20,221 INFO L226 Difference]: Without dead ends: 36943 [2018-10-24 14:54:20,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:20,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36943 states. [2018-10-24 14:54:20,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36943 to 36123. [2018-10-24 14:54:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36123 states. [2018-10-24 14:54:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36123 states to 36123 states and 42545 transitions. [2018-10-24 14:54:20,695 INFO L78 Accepts]: Start accepts. Automaton has 36123 states and 42545 transitions. Word has length 297 [2018-10-24 14:54:20,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:20,696 INFO L481 AbstractCegarLoop]: Abstraction has 36123 states and 42545 transitions. [2018-10-24 14:54:20,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:54:20,696 INFO L276 IsEmpty]: Start isEmpty. Operand 36123 states and 42545 transitions. [2018-10-24 14:54:20,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-10-24 14:54:20,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:20,746 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:54:20,746 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:20,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:20,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1535431556, now seen corresponding path program 1 times [2018-10-24 14:54:20,747 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:20,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:20,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:20,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:20,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:21,095 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-24 14:54:21,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:21,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:21,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:21,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:21,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:21,097 INFO L87 Difference]: Start difference. First operand 36123 states and 42545 transitions. Second operand 3 states. [2018-10-24 14:54:21,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:21,762 INFO L93 Difference]: Finished difference Result 99940 states and 116643 transitions. [2018-10-24 14:54:21,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:21,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 376 [2018-10-24 14:54:21,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:21,829 INFO L225 Difference]: With dead ends: 99940 [2018-10-24 14:54:21,830 INFO L226 Difference]: Without dead ends: 63819 [2018-10-24 14:54:21,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:21,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63819 states. [2018-10-24 14:54:23,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63819 to 62797. [2018-10-24 14:54:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62797 states. [2018-10-24 14:54:23,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62797 states to 62797 states and 72578 transitions. [2018-10-24 14:54:23,089 INFO L78 Accepts]: Start accepts. Automaton has 62797 states and 72578 transitions. Word has length 376 [2018-10-24 14:54:23,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:23,089 INFO L481 AbstractCegarLoop]: Abstraction has 62797 states and 72578 transitions. [2018-10-24 14:54:23,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 62797 states and 72578 transitions. [2018-10-24 14:54:23,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-24 14:54:23,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:23,138 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 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] [2018-10-24 14:54:23,138 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:23,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:23,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1863338128, now seen corresponding path program 1 times [2018-10-24 14:54:23,138 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:23,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:23,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:23,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:23,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-10-24 14:54:23,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:23,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:23,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:23,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:23,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:23,440 INFO L87 Difference]: Start difference. First operand 62797 states and 72578 transitions. Second operand 4 states. [2018-10-24 14:54:25,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:25,625 INFO L93 Difference]: Finished difference Result 193045 states and 222475 transitions. [2018-10-24 14:54:25,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:25,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 380 [2018-10-24 14:54:25,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:25,786 INFO L225 Difference]: With dead ends: 193045 [2018-10-24 14:54:25,786 INFO L226 Difference]: Without dead ends: 130250 [2018-10-24 14:54:25,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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:54:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130250 states. [2018-10-24 14:54:27,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130250 to 95427. [2018-10-24 14:54:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95427 states. [2018-10-24 14:54:27,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95427 states to 95427 states and 109051 transitions. [2018-10-24 14:54:27,833 INFO L78 Accepts]: Start accepts. Automaton has 95427 states and 109051 transitions. Word has length 380 [2018-10-24 14:54:27,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:27,833 INFO L481 AbstractCegarLoop]: Abstraction has 95427 states and 109051 transitions. [2018-10-24 14:54:27,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:27,833 INFO L276 IsEmpty]: Start isEmpty. Operand 95427 states and 109051 transitions. [2018-10-24 14:54:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-10-24 14:54:27,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:27,909 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:54:27,909 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:27,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:27,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1195384308, now seen corresponding path program 1 times [2018-10-24 14:54:27,910 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:27,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:27,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:27,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:27,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:28,174 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-24 14:54:28,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:28,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:28,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:28,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:28,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:28,176 INFO L87 Difference]: Start difference. First operand 95427 states and 109051 transitions. Second operand 3 states. [2018-10-24 14:54:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:30,402 INFO L93 Difference]: Finished difference Result 188403 states and 215277 transitions. [2018-10-24 14:54:30,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:30,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2018-10-24 14:54:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:30,519 INFO L225 Difference]: With dead ends: 188403 [2018-10-24 14:54:30,519 INFO L226 Difference]: Without dead ends: 92978 [2018-10-24 14:54:30,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92978 states. [2018-10-24 14:54:31,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92978 to 88890. [2018-10-24 14:54:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88890 states. [2018-10-24 14:54:31,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88890 states to 88890 states and 98457 transitions. [2018-10-24 14:54:31,532 INFO L78 Accepts]: Start accepts. Automaton has 88890 states and 98457 transitions. Word has length 392 [2018-10-24 14:54:31,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:31,533 INFO L481 AbstractCegarLoop]: Abstraction has 88890 states and 98457 transitions. [2018-10-24 14:54:31,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:31,533 INFO L276 IsEmpty]: Start isEmpty. Operand 88890 states and 98457 transitions. [2018-10-24 14:54:31,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-10-24 14:54:31,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:31,592 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:31,592 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:31,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:31,593 INFO L82 PathProgramCache]: Analyzing trace with hash -752262207, now seen corresponding path program 1 times [2018-10-24 14:54:31,593 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:31,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:31,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:31,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:31,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-24 14:54:32,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:32,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:54:32,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:54:32,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:54:32,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:32,860 INFO L87 Difference]: Start difference. First operand 88890 states and 98457 transitions. Second operand 5 states. [2018-10-24 14:54:37,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:37,315 INFO L93 Difference]: Finished difference Result 395269 states and 435691 transitions. [2018-10-24 14:54:37,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:54:37,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 405 [2018-10-24 14:54:37,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:37,671 INFO L225 Difference]: With dead ends: 395269 [2018-10-24 14:54:37,671 INFO L226 Difference]: Without dead ends: 306381 [2018-10-24 14:54:37,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:37,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306381 states. [2018-10-24 14:54:41,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306381 to 229164. [2018-10-24 14:54:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229164 states. [2018-10-24 14:54:41,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229164 states to 229164 states and 251822 transitions. [2018-10-24 14:54:41,731 INFO L78 Accepts]: Start accepts. Automaton has 229164 states and 251822 transitions. Word has length 405 [2018-10-24 14:54:41,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:41,731 INFO L481 AbstractCegarLoop]: Abstraction has 229164 states and 251822 transitions. [2018-10-24 14:54:41,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:54:41,731 INFO L276 IsEmpty]: Start isEmpty. Operand 229164 states and 251822 transitions. [2018-10-24 14:54:41,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-10-24 14:54:41,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:41,782 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:54:41,782 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:41,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:41,783 INFO L82 PathProgramCache]: Analyzing trace with hash 198739997, now seen corresponding path program 1 times [2018-10-24 14:54:41,783 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:41,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:41,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:41,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:41,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:42,109 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-24 14:54:42,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:42,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:42,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:42,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:42,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:42,111 INFO L87 Difference]: Start difference. First operand 229164 states and 251822 transitions. Second operand 3 states. [2018-10-24 14:54:46,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:46,002 INFO L93 Difference]: Finished difference Result 662223 states and 726717 transitions. [2018-10-24 14:54:46,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:46,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 406 [2018-10-24 14:54:46,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:46,722 INFO L225 Difference]: With dead ends: 662223 [2018-10-24 14:54:46,722 INFO L226 Difference]: Without dead ends: 433061 [2018-10-24 14:54:46,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:47,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433061 states. [2018-10-24 14:54:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433061 to 433059. [2018-10-24 14:54:58,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433059 states. [2018-10-24 14:54:59,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433059 states to 433059 states and 474837 transitions. [2018-10-24 14:54:59,226 INFO L78 Accepts]: Start accepts. Automaton has 433059 states and 474837 transitions. Word has length 406 [2018-10-24 14:54:59,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:59,226 INFO L481 AbstractCegarLoop]: Abstraction has 433059 states and 474837 transitions. [2018-10-24 14:54:59,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:59,226 INFO L276 IsEmpty]: Start isEmpty. Operand 433059 states and 474837 transitions. [2018-10-24 14:54:59,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-10-24 14:54:59,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:59,286 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:54:59,286 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:59,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:59,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1782633300, now seen corresponding path program 1 times [2018-10-24 14:54:59,286 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:59,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:59,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:59,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:59,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:01,014 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-24 14:55:01,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:01,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:55:01,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:55:01,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:55:01,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:55:01,017 INFO L87 Difference]: Start difference. First operand 433059 states and 474837 transitions. Second operand 3 states. [2018-10-24 14:55:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:06,723 INFO L93 Difference]: Finished difference Result 1074660 states and 1175096 transitions. [2018-10-24 14:55:06,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:55:06,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 413 [2018-10-24 14:55:06,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:07,466 INFO L225 Difference]: With dead ends: 1074660 [2018-10-24 14:55:07,466 INFO L226 Difference]: Without dead ends: 641603 [2018-10-24 14:55:07,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:55:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641603 states. [2018-10-24 14:55:15,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641603 to 641601. [2018-10-24 14:55:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641601 states. [2018-10-24 14:55:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641601 states to 641601 states and 700154 transitions. [2018-10-24 14:55:17,656 INFO L78 Accepts]: Start accepts. Automaton has 641601 states and 700154 transitions. Word has length 413 [2018-10-24 14:55:17,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:17,657 INFO L481 AbstractCegarLoop]: Abstraction has 641601 states and 700154 transitions. [2018-10-24 14:55:17,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:55:17,657 INFO L276 IsEmpty]: Start isEmpty. Operand 641601 states and 700154 transitions. [2018-10-24 14:55:17,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-10-24 14:55:17,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:17,724 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:17,724 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:17,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:17,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1682052167, now seen corresponding path program 1 times [2018-10-24 14:55:17,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:17,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:17,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:17,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:17,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:18,172 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 14:55:18,340 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 14:55:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 14:55:18,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:18,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 14:55:18,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:55:18,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:55:18,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:55:18,522 INFO L87 Difference]: Start difference. First operand 641601 states and 700154 transitions. Second operand 5 states. [2018-10-24 14:55:31,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:31,647 INFO L93 Difference]: Finished difference Result 1391620 states and 1517895 transitions. [2018-10-24 14:55:31,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:55:31,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 427 [2018-10-24 14:55:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:34,077 INFO L225 Difference]: With dead ends: 1391620 [2018-10-24 14:55:34,077 INFO L226 Difference]: Without dead ends: 750021 [2018-10-24 14:55:34,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:55:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750021 states. [2018-10-24 14:55:44,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750021 to 681782. [2018-10-24 14:55:44,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681782 states. [2018-10-24 14:55:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681782 states to 681782 states and 745845 transitions. [2018-10-24 14:55:44,840 INFO L78 Accepts]: Start accepts. Automaton has 681782 states and 745845 transitions. Word has length 427 [2018-10-24 14:55:44,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:44,840 INFO L481 AbstractCegarLoop]: Abstraction has 681782 states and 745845 transitions. [2018-10-24 14:55:44,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:55:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand 681782 states and 745845 transitions. [2018-10-24 14:55:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-10-24 14:55:44,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:44,920 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:44,920 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:44,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:44,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2022441858, now seen corresponding path program 1 times [2018-10-24 14:55:44,921 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:44,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:44,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:44,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:44,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-24 14:55:46,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:46,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:55:46,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:55:46,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:55:46,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:55:46,697 INFO L87 Difference]: Start difference. First operand 681782 states and 745845 transitions. Second operand 4 states. [2018-10-24 14:55:59,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:59,973 INFO L93 Difference]: Finished difference Result 1326458 states and 1451848 transitions. [2018-10-24 14:55:59,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:55:59,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 430 [2018-10-24 14:55:59,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:02,209 INFO L225 Difference]: With dead ends: 1326458 [2018-10-24 14:56:02,209 INFO L226 Difference]: Without dead ends: 644678 [2018-10-24 14:56:02,452 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:56:02,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644678 states. [2018-10-24 14:56:11,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644678 to 644235. [2018-10-24 14:56:11,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644235 states. [2018-10-24 14:56:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644235 states to 644235 states and 701522 transitions. [2018-10-24 14:56:12,634 INFO L78 Accepts]: Start accepts. Automaton has 644235 states and 701522 transitions. Word has length 430 [2018-10-24 14:56:12,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:12,634 INFO L481 AbstractCegarLoop]: Abstraction has 644235 states and 701522 transitions. [2018-10-24 14:56:12,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:56:12,634 INFO L276 IsEmpty]: Start isEmpty. Operand 644235 states and 701522 transitions. [2018-10-24 14:56:12,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-10-24 14:56:12,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:12,710 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:12,710 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:12,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:12,711 INFO L82 PathProgramCache]: Analyzing trace with hash 470669778, now seen corresponding path program 1 times [2018-10-24 14:56:12,711 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:12,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:12,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:12,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:12,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-10-24 14:56:13,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:13,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:13,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:56:13,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:56:13,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:13,093 INFO L87 Difference]: Start difference. First operand 644235 states and 701522 transitions. Second operand 4 states. [2018-10-24 14:56:22,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:22,124 INFO L93 Difference]: Finished difference Result 1284246 states and 1400202 transitions. [2018-10-24 14:56:22,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:56:22,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 435 [2018-10-24 14:56:22,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:23,108 INFO L225 Difference]: With dead ends: 1284246 [2018-10-24 14:56:23,108 INFO L226 Difference]: Without dead ends: 640013 [2018-10-24 14:56:23,386 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:56:23,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640013 states. [2018-10-24 14:56:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640013 to 604299. [2018-10-24 14:56:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604299 states. [2018-10-24 14:56:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604299 states to 604299 states and 655077 transitions. [2018-10-24 14:56:45,369 INFO L78 Accepts]: Start accepts. Automaton has 604299 states and 655077 transitions. Word has length 435 [2018-10-24 14:56:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:45,370 INFO L481 AbstractCegarLoop]: Abstraction has 604299 states and 655077 transitions. [2018-10-24 14:56:45,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:56:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 604299 states and 655077 transitions. [2018-10-24 14:56:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-10-24 14:56:45,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:45,419 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:56:45,419 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:45,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:45,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1457690783, now seen corresponding path program 1 times [2018-10-24 14:56:45,420 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:45,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:45,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:45,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:45,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-24 14:56:45,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:45,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:56:45,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:56:45,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:56:45,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:45,879 INFO L87 Difference]: Start difference. First operand 604299 states and 655077 transitions. Second operand 4 states. Received shutdown request... [2018-10-24 14:56:55,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:56:55,160 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:56:55,165 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:56:55,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:56:55 BoogieIcfgContainer [2018-10-24 14:56:55,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:56:55,167 INFO L168 Benchmark]: Toolchain (without parser) took 197497.15 ms. Allocated memory was 1.5 GB in the beginning and 6.7 GB in the end (delta: 5.2 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2018-10-24 14:56:55,168 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:56:55,169 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1129.16 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:56:55,170 INFO L168 Benchmark]: Boogie Procedure Inliner took 314.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -886.6 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-24 14:56:55,170 INFO L168 Benchmark]: Boogie Preprocessor took 132.98 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:56:55,171 INFO L168 Benchmark]: RCFGBuilder took 6282.30 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 257.1 MB). Peak memory consumption was 257.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:56:55,172 INFO L168 Benchmark]: TraceAbstraction took 189631.92 ms. Allocated memory was 2.3 GB in the beginning and 6.7 GB in the end (delta: 4.4 GB). Free memory was 2.0 GB in the beginning and 3.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. [2018-10-24 14:56:55,178 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1129.16 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 314.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 763.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -886.6 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 132.98 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6282.30 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 257.1 MB). Peak memory consumption was 257.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 189631.92 ms. Allocated memory was 2.3 GB in the beginning and 6.7 GB in the end (delta: 4.4 GB). Free memory was 2.0 GB in the beginning and 3.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1647]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1647). Cancelled while BasicCegarLoop was constructing difference of abstraction (604299states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (1350174 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 189.5s OverallTime, 20 OverallIterations, 6 TraceHistogramMax, 101.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5976 SDtfs, 12123 SDslu, 3729 SDs, 0 SdLazy, 19126 SolverSat, 3854 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 620 GetRequests, 576 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=681782occurred 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: 75.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 224369 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 7077 NumberOfCodeBlocks, 7077 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 7055 ConstructedInterpolants, 0 QuantifiedInterpolants, 4104398 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1038 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 4057/4069 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown