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_label03_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:53:38,640 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:53:38,642 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:53:38,656 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:53:38,657 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:53:38,658 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:53:38,659 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:53:38,661 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:53:38,662 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:53:38,663 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:53:38,664 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:53:38,665 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:53:38,665 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:53:38,666 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:53:38,668 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:53:38,668 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:53:38,669 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:53:38,671 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:53:38,673 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:53:38,674 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:53:38,676 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:53:38,677 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:53:38,679 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:53:38,679 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:53:38,680 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:53:38,681 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:53:38,683 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:53:38,683 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:53:38,684 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:53:38,689 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:53:38,689 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:53:38,690 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:53:38,691 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:53:38,691 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:53:38,692 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:53:38,692 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:53:38,693 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:38,718 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:53:38,719 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:53:38,719 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:53:38,722 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:53:38,723 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:53:38,723 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:53:38,724 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:53:38,725 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:53:38,725 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:53:38,725 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:53:38,725 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:53:38,725 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:53:38,726 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:53:38,726 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:53:38,726 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:53:38,726 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:53:38,726 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:53:38,727 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:53:38,728 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:53:38,728 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:53:38,728 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:53:38,729 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:53:38,729 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:53:38,729 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:53:38,729 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:53:38,729 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:53:38,730 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:53:38,730 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:53:38,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:53:38,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:53:38,805 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:53:38,807 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:53:38,807 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:53:38,808 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label03_true-unreach-call.c [2018-10-24 14:53:38,876 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c142d0a07/524646f7ed8d49afa35a7499d8fc20fd/FLAGc680fbc35 [2018-10-24 14:53:39,569 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:53:39,570 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label03_true-unreach-call.c [2018-10-24 14:53:39,587 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c142d0a07/524646f7ed8d49afa35a7499d8fc20fd/FLAGc680fbc35 [2018-10-24 14:53:39,601 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/c142d0a07/524646f7ed8d49afa35a7499d8fc20fd [2018-10-24 14:53:39,612 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:53:39,613 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:53:39,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:39,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:53:39,618 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:53:39,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:39" (1/1) ... [2018-10-24 14:53:39,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d204f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:39, skipping insertion in model container [2018-10-24 14:53:39,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:53:39" (1/1) ... [2018-10-24 14:53:39,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:53:39,725 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:53:40,450 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:40,464 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:53:40,754 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:53:40,779 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:53:40,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:40 WrapperNode [2018-10-24 14:53:40,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:53:40,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:40,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:53:40,781 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:53:40,792 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:40" (1/1) ... [2018-10-24 14:53:40,840 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:40" (1/1) ... [2018-10-24 14:53:41,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:53:41,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:53:41,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:53:41,091 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:53:41,103 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:40" (1/1) ... [2018-10-24 14:53:41,103 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:40" (1/1) ... [2018-10-24 14:53:41,110 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:40" (1/1) ... [2018-10-24 14:53:41,111 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:40" (1/1) ... [2018-10-24 14:53:41,156 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:40" (1/1) ... [2018-10-24 14:53:41,180 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:40" (1/1) ... [2018-10-24 14:53:41,191 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:40" (1/1) ... [2018-10-24 14:53:41,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:53:41,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:53:41,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:53:41,205 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:53:41,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:40" (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:41,273 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:53:41,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:53:41,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:53:46,843 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:53:46,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:53:46 BoogieIcfgContainer [2018-10-24 14:53:46,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:53:46,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:53:46,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:53:46,849 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:53:46,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:53:39" (1/3) ... [2018-10-24 14:53:46,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382564f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:53:46, skipping insertion in model container [2018-10-24 14:53:46,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:53:40" (2/3) ... [2018-10-24 14:53:46,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382564f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:53:46, skipping insertion in model container [2018-10-24 14:53:46,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:53:46" (3/3) ... [2018-10-24 14:53:46,853 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label03_true-unreach-call.c [2018-10-24 14:53:46,864 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:53:46,872 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:53:46,891 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:53:46,930 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:53:46,931 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:53:46,931 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:53:46,931 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:53:46,932 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:53:46,932 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:53:46,932 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:53:46,932 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:53:46,932 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:53:46,958 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:53:46,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-24 14:53:46,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:46,977 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] [2018-10-24 14:53:46,980 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:46,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:46,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1347359086, now seen corresponding path program 1 times [2018-10-24 14:53:46,989 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:46,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:47,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:47,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:47,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:47,884 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:47,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:47,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:53:47,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:53:47,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:53:47,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:53:47,914 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:53:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:51,066 INFO L93 Difference]: Finished difference Result 1089 states and 1954 transitions. [2018-10-24 14:53:51,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:53:51,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-10-24 14:53:51,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:51,096 INFO L225 Difference]: With dead ends: 1089 [2018-10-24 14:53:51,096 INFO L226 Difference]: Without dead ends: 779 [2018-10-24 14:53:51,102 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:51,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-24 14:53:51,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 515. [2018-10-24 14:53:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-24 14:53:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 887 transitions. [2018-10-24 14:53:51,319 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 887 transitions. Word has length 165 [2018-10-24 14:53:51,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:51,323 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 887 transitions. [2018-10-24 14:53:51,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:53:51,324 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 887 transitions. [2018-10-24 14:53:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-24 14:53:51,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:51,337 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,337 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:51,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:51,338 INFO L82 PathProgramCache]: Analyzing trace with hash 751655233, now seen corresponding path program 1 times [2018-10-24 14:53:51,338 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:51,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:51,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:51,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:51,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:53:51,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:51,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:53:51,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:53:51,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:53:51,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:53:51,576 INFO L87 Difference]: Start difference. First operand 515 states and 887 transitions. Second operand 4 states. [2018-10-24 14:53:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:56,256 INFO L93 Difference]: Finished difference Result 1904 states and 3379 transitions. [2018-10-24 14:53:56,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:53:56,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2018-10-24 14:53:56,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:56,265 INFO L225 Difference]: With dead ends: 1904 [2018-10-24 14:53:56,266 INFO L226 Difference]: Without dead ends: 1391 [2018-10-24 14:53:56,269 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:53:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2018-10-24 14:53:56,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 927. [2018-10-24 14:53:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-24 14:53:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1521 transitions. [2018-10-24 14:53:56,304 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1521 transitions. Word has length 171 [2018-10-24 14:53:56,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:56,305 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 1521 transitions. [2018-10-24 14:53:56,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:53:56,305 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1521 transitions. [2018-10-24 14:53:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-24 14:53:56,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:56,309 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,309 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:56,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:56,310 INFO L82 PathProgramCache]: Analyzing trace with hash -942218426, now seen corresponding path program 1 times [2018-10-24 14:53:56,310 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:56,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:56,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:56,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:56,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:53:56,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:56,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:53:56,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:53:56,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:53:56,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:56,440 INFO L87 Difference]: Start difference. First operand 927 states and 1521 transitions. Second operand 3 states. [2018-10-24 14:53:58,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:58,347 INFO L93 Difference]: Finished difference Result 2711 states and 4483 transitions. [2018-10-24 14:53:58,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:53:58,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-10-24 14:53:58,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:58,358 INFO L225 Difference]: With dead ends: 2711 [2018-10-24 14:53:58,358 INFO L226 Difference]: Without dead ends: 1786 [2018-10-24 14:53:58,360 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:58,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2018-10-24 14:53:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1784. [2018-10-24 14:53:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2018-10-24 14:53:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2738 transitions. [2018-10-24 14:53:58,398 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2738 transitions. Word has length 172 [2018-10-24 14:53:58,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:58,399 INFO L481 AbstractCegarLoop]: Abstraction has 1784 states and 2738 transitions. [2018-10-24 14:53:58,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:53:58,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2738 transitions. [2018-10-24 14:53:58,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-24 14:53:58,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:53:58,404 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] [2018-10-24 14:53:58,404 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:53:58,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:53:58,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1357798669, now seen corresponding path program 1 times [2018-10-24 14:53:58,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:53:58,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:53:58,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:58,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:53:58,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:53:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:53:58,498 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:58,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:53:58,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:53:58,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:53:58,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:53:58,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:53:58,500 INFO L87 Difference]: Start difference. First operand 1784 states and 2738 transitions. Second operand 3 states. [2018-10-24 14:53:59,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:53:59,853 INFO L93 Difference]: Finished difference Result 5215 states and 8074 transitions. [2018-10-24 14:53:59,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:53:59,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-10-24 14:53:59,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:53:59,872 INFO L225 Difference]: With dead ends: 5215 [2018-10-24 14:53:59,873 INFO L226 Difference]: Without dead ends: 3433 [2018-10-24 14:53:59,876 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:59,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2018-10-24 14:53:59,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3416. [2018-10-24 14:53:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3416 states. [2018-10-24 14:53:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 5132 transitions. [2018-10-24 14:53:59,998 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 5132 transitions. Word has length 174 [2018-10-24 14:53:59,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:53:59,999 INFO L481 AbstractCegarLoop]: Abstraction has 3416 states and 5132 transitions. [2018-10-24 14:53:59,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:53:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 5132 transitions. [2018-10-24 14:54:00,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-24 14:54:00,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:00,006 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,006 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:00,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:00,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1216147553, now seen corresponding path program 1 times [2018-10-24 14:54:00,007 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:00,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:00,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:00,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:00,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:00,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:00,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:00,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:00,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:00,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:00,344 INFO L87 Difference]: Start difference. First operand 3416 states and 5132 transitions. Second operand 3 states. [2018-10-24 14:54:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:02,072 INFO L93 Difference]: Finished difference Result 6836 states and 10274 transitions. [2018-10-24 14:54:02,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:02,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-10-24 14:54:02,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:02,092 INFO L225 Difference]: With dead ends: 6836 [2018-10-24 14:54:02,092 INFO L226 Difference]: Without dead ends: 3422 [2018-10-24 14:54:02,097 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:02,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2018-10-24 14:54:02,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 3416. [2018-10-24 14:54:02,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3416 states. [2018-10-24 14:54:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 4798 transitions. [2018-10-24 14:54:02,159 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 4798 transitions. Word has length 182 [2018-10-24 14:54:02,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:02,160 INFO L481 AbstractCegarLoop]: Abstraction has 3416 states and 4798 transitions. [2018-10-24 14:54:02,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:02,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 4798 transitions. [2018-10-24 14:54:02,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-24 14:54:02,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:02,171 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2018-10-24 14:54:02,171 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:02,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:02,171 INFO L82 PathProgramCache]: Analyzing trace with hash -50533991, now seen corresponding path program 1 times [2018-10-24 14:54:02,171 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:02,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:02,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:02,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:02,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:02,323 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:02,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:02,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:02,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:02,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:02,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:02,325 INFO L87 Difference]: Start difference. First operand 3416 states and 4798 transitions. Second operand 3 states. [2018-10-24 14:54:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:03,949 INFO L93 Difference]: Finished difference Result 10097 states and 14225 transitions. [2018-10-24 14:54:03,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:03,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-10-24 14:54:03,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:03,974 INFO L225 Difference]: With dead ends: 10097 [2018-10-24 14:54:03,974 INFO L226 Difference]: Without dead ends: 6683 [2018-10-24 14:54:03,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:03,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6683 states. [2018-10-24 14:54:04,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6683 to 6681. [2018-10-24 14:54:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6681 states. [2018-10-24 14:54:04,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6681 states to 6681 states and 8561 transitions. [2018-10-24 14:54:04,095 INFO L78 Accepts]: Start accepts. Automaton has 6681 states and 8561 transitions. Word has length 189 [2018-10-24 14:54:04,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:04,095 INFO L481 AbstractCegarLoop]: Abstraction has 6681 states and 8561 transitions. [2018-10-24 14:54:04,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:04,095 INFO L276 IsEmpty]: Start isEmpty. Operand 6681 states and 8561 transitions. [2018-10-24 14:54:04,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-24 14:54:04,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:04,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,108 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:04,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:04,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1485224914, now seen corresponding path program 1 times [2018-10-24 14:54:04,109 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:04,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:04,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:04,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:04,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:04,302 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:04,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:04,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:04,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:04,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:04,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:04,304 INFO L87 Difference]: Start difference. First operand 6681 states and 8561 transitions. Second operand 4 states. [2018-10-24 14:54:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:06,830 INFO L93 Difference]: Finished difference Result 26271 states and 33635 transitions. [2018-10-24 14:54:06,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:06,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-10-24 14:54:06,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:06,887 INFO L225 Difference]: With dead ends: 26271 [2018-10-24 14:54:06,887 INFO L226 Difference]: Without dead ends: 19592 [2018-10-24 14:54:06,895 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:06,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19592 states. [2018-10-24 14:54:07,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19592 to 13007. [2018-10-24 14:54:07,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13007 states. [2018-10-24 14:54:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13007 states to 13007 states and 16047 transitions. [2018-10-24 14:54:07,132 INFO L78 Accepts]: Start accepts. Automaton has 13007 states and 16047 transitions. Word has length 189 [2018-10-24 14:54:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:07,132 INFO L481 AbstractCegarLoop]: Abstraction has 13007 states and 16047 transitions. [2018-10-24 14:54:07,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 13007 states and 16047 transitions. [2018-10-24 14:54:07,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-24 14:54:07,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:07,154 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,154 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:07,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:07,155 INFO L82 PathProgramCache]: Analyzing trace with hash -974747267, now seen corresponding path program 1 times [2018-10-24 14:54:07,155 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:07,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:07,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:07,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:07,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:07,267 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-24 14:54:07,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:07,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:07,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:07,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:07,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:07,268 INFO L87 Difference]: Start difference. First operand 13007 states and 16047 transitions. Second operand 3 states. [2018-10-24 14:54:08,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:08,177 INFO L93 Difference]: Finished difference Result 25980 states and 32049 transitions. [2018-10-24 14:54:08,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:08,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2018-10-24 14:54:08,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:08,209 INFO L225 Difference]: With dead ends: 25980 [2018-10-24 14:54:08,209 INFO L226 Difference]: Without dead ends: 12975 [2018-10-24 14:54:08,222 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:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12975 states. [2018-10-24 14:54:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12975 to 12975. [2018-10-24 14:54:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12975 states. [2018-10-24 14:54:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12975 states to 12975 states and 15735 transitions. [2018-10-24 14:54:08,379 INFO L78 Accepts]: Start accepts. Automaton has 12975 states and 15735 transitions. Word has length 227 [2018-10-24 14:54:08,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:08,380 INFO L481 AbstractCegarLoop]: Abstraction has 12975 states and 15735 transitions. [2018-10-24 14:54:08,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 12975 states and 15735 transitions. [2018-10-24 14:54:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-24 14:54:08,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:08,398 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, 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] [2018-10-24 14:54:08,398 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:08,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:08,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1948082637, now seen corresponding path program 1 times [2018-10-24 14:54:08,399 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:08,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:08,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:08,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:08,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:08,723 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 14:54:08,761 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:08,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:08,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:08,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:08,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:08,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:08,763 INFO L87 Difference]: Start difference. First operand 12975 states and 15735 transitions. Second operand 4 states. [2018-10-24 14:54:10,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:10,707 INFO L93 Difference]: Finished difference Result 30643 states and 37689 transitions. [2018-10-24 14:54:10,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:10,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2018-10-24 14:54:10,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:10,728 INFO L225 Difference]: With dead ends: 30643 [2018-10-24 14:54:10,729 INFO L226 Difference]: Without dead ends: 17670 [2018-10-24 14:54:10,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:10,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17670 states. [2018-10-24 14:54:10,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17670 to 17667. [2018-10-24 14:54:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17667 states. [2018-10-24 14:54:10,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17667 states to 17667 states and 20516 transitions. [2018-10-24 14:54:10,949 INFO L78 Accepts]: Start accepts. Automaton has 17667 states and 20516 transitions. Word has length 230 [2018-10-24 14:54:10,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:10,950 INFO L481 AbstractCegarLoop]: Abstraction has 17667 states and 20516 transitions. [2018-10-24 14:54:10,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:10,950 INFO L276 IsEmpty]: Start isEmpty. Operand 17667 states and 20516 transitions. [2018-10-24 14:54:10,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-24 14:54:10,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:10,970 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:54:10,970 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:10,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:10,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1958712054, now seen corresponding path program 1 times [2018-10-24 14:54:10,971 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:10,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:10,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:10,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:10,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:54:11,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:11,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:11,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:11,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:11,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:11,294 INFO L87 Difference]: Start difference. First operand 17667 states and 20516 transitions. Second operand 3 states. [2018-10-24 14:54:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:12,597 INFO L93 Difference]: Finished difference Result 34923 states and 40585 transitions. [2018-10-24 14:54:12,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:12,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2018-10-24 14:54:12,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:12,616 INFO L225 Difference]: With dead ends: 34923 [2018-10-24 14:54:12,617 INFO L226 Difference]: Without dead ends: 17258 [2018-10-24 14:54:12,632 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:12,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17258 states. [2018-10-24 14:54:12,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17258 to 17257. [2018-10-24 14:54:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17257 states. [2018-10-24 14:54:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17257 states to 17257 states and 19455 transitions. [2018-10-24 14:54:12,824 INFO L78 Accepts]: Start accepts. Automaton has 17257 states and 19455 transitions. Word has length 256 [2018-10-24 14:54:12,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:12,825 INFO L481 AbstractCegarLoop]: Abstraction has 17257 states and 19455 transitions. [2018-10-24 14:54:12,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:12,825 INFO L276 IsEmpty]: Start isEmpty. Operand 17257 states and 19455 transitions. [2018-10-24 14:54:12,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-24 14:54:12,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:12,846 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, 2, 2, 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:54:12,846 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:12,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:12,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2046103689, now seen corresponding path program 1 times [2018-10-24 14:54:12,847 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:12,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:12,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:12,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:12,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:13,217 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-24 14:54:13,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:13,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:54:13,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:54:13,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:54:13,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:13,219 INFO L87 Difference]: Start difference. First operand 17257 states and 19455 transitions. Second operand 5 states. [2018-10-24 14:54:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:15,489 INFO L93 Difference]: Finished difference Result 52355 states and 58792 transitions. [2018-10-24 14:54:15,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:54:15,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 266 [2018-10-24 14:54:15,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:15,521 INFO L225 Difference]: With dead ends: 52355 [2018-10-24 14:54:15,522 INFO L226 Difference]: Without dead ends: 35100 [2018-10-24 14:54:15,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:54:15,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35100 states. [2018-10-24 14:54:15,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35100 to 35095. [2018-10-24 14:54:15,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35095 states. [2018-10-24 14:54:15,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35095 states to 35095 states and 39310 transitions. [2018-10-24 14:54:15,963 INFO L78 Accepts]: Start accepts. Automaton has 35095 states and 39310 transitions. Word has length 266 [2018-10-24 14:54:15,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:15,964 INFO L481 AbstractCegarLoop]: Abstraction has 35095 states and 39310 transitions. [2018-10-24 14:54:15,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:54:15,964 INFO L276 IsEmpty]: Start isEmpty. Operand 35095 states and 39310 transitions. [2018-10-24 14:54:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-24 14:54:15,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:15,991 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 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] [2018-10-24 14:54:15,991 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:15,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:15,992 INFO L82 PathProgramCache]: Analyzing trace with hash 646529718, now seen corresponding path program 1 times [2018-10-24 14:54:15,992 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:15,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:15,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:15,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:15,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-24 14:54:16,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:16,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:16,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:16,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:16,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:16,537 INFO L87 Difference]: Start difference. First operand 35095 states and 39310 transitions. Second operand 4 states. [2018-10-24 14:54:17,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:17,968 INFO L93 Difference]: Finished difference Result 69313 states and 77621 transitions. [2018-10-24 14:54:17,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:17,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2018-10-24 14:54:17,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:18,001 INFO L225 Difference]: With dead ends: 69313 [2018-10-24 14:54:18,002 INFO L226 Difference]: Without dead ends: 34220 [2018-10-24 14:54:18,025 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:54:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34220 states. [2018-10-24 14:54:18,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34220 to 34220. [2018-10-24 14:54:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34220 states. [2018-10-24 14:54:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34220 states to 34220 states and 37008 transitions. [2018-10-24 14:54:18,382 INFO L78 Accepts]: Start accepts. Automaton has 34220 states and 37008 transitions. Word has length 267 [2018-10-24 14:54:18,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:18,382 INFO L481 AbstractCegarLoop]: Abstraction has 34220 states and 37008 transitions. [2018-10-24 14:54:18,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:18,382 INFO L276 IsEmpty]: Start isEmpty. Operand 34220 states and 37008 transitions. [2018-10-24 14:54:18,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-24 14:54:18,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:18,391 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 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, 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] [2018-10-24 14:54:18,391 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:18,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:18,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1794947131, now seen corresponding path program 1 times [2018-10-24 14:54:18,391 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:18,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:18,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:18,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:18,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:18,720 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 14:54:18,770 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-24 14:54:18,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:18,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:54:18,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:54:18,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:54:18,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:18,772 INFO L87 Difference]: Start difference. First operand 34220 states and 37008 transitions. Second operand 4 states. [2018-10-24 14:54:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:20,987 INFO L93 Difference]: Finished difference Result 120696 states and 130174 transitions. [2018-10-24 14:54:20,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:54:20,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 269 [2018-10-24 14:54:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:21,371 INFO L225 Difference]: With dead ends: 120696 [2018-10-24 14:54:21,371 INFO L226 Difference]: Without dead ends: 86478 [2018-10-24 14:54:21,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:54:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86478 states. [2018-10-24 14:54:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86478 to 86474. [2018-10-24 14:54:22,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86474 states. [2018-10-24 14:54:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86474 states to 86474 states and 93054 transitions. [2018-10-24 14:54:22,167 INFO L78 Accepts]: Start accepts. Automaton has 86474 states and 93054 transitions. Word has length 269 [2018-10-24 14:54:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:22,167 INFO L481 AbstractCegarLoop]: Abstraction has 86474 states and 93054 transitions. [2018-10-24 14:54:22,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:54:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 86474 states and 93054 transitions. [2018-10-24 14:54:22,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-24 14:54:22,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:22,177 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,177 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:22,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:22,177 INFO L82 PathProgramCache]: Analyzing trace with hash 74302533, now seen corresponding path program 1 times [2018-10-24 14:54:22,178 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:22,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:22,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:22,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:22,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-24 14:54:22,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:22,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:22,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:22,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:22,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:22,398 INFO L87 Difference]: Start difference. First operand 86474 states and 93054 transitions. Second operand 3 states. [2018-10-24 14:54:24,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:24,939 INFO L93 Difference]: Finished difference Result 172943 states and 186103 transitions. [2018-10-24 14:54:24,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:24,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2018-10-24 14:54:24,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:25,018 INFO L225 Difference]: With dead ends: 172943 [2018-10-24 14:54:25,018 INFO L226 Difference]: Without dead ends: 86471 [2018-10-24 14:54:25,058 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:25,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86471 states. [2018-10-24 14:54:26,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86471 to 86471. [2018-10-24 14:54:26,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86471 states. [2018-10-24 14:54:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86471 states to 86471 states and 93048 transitions. [2018-10-24 14:54:26,612 INFO L78 Accepts]: Start accepts. Automaton has 86471 states and 93048 transitions. Word has length 298 [2018-10-24 14:54:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:26,612 INFO L481 AbstractCegarLoop]: Abstraction has 86471 states and 93048 transitions. [2018-10-24 14:54:26,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 86471 states and 93048 transitions. [2018-10-24 14:54:26,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-24 14:54:26,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:26,622 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,623 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:26,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:26,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1488256468, now seen corresponding path program 1 times [2018-10-24 14:54:26,623 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:26,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:26,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:26,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:26,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-24 14:54:26,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:54:26,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:54:26,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:54:26,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:54:26,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:54:26,843 INFO L87 Difference]: Start difference. First operand 86471 states and 93048 transitions. Second operand 3 states. [2018-10-24 14:54:29,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:29,741 INFO L93 Difference]: Finished difference Result 214956 states and 231088 transitions. [2018-10-24 14:54:29,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:54:29,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2018-10-24 14:54:29,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:29,880 INFO L225 Difference]: With dead ends: 214956 [2018-10-24 14:54:29,880 INFO L226 Difference]: Without dead ends: 128487 [2018-10-24 14:54:29,933 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:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128487 states. [2018-10-24 14:54:32,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128487 to 125606. [2018-10-24 14:54:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125606 states. [2018-10-24 14:54:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125606 states to 125606 states and 134938 transitions. [2018-10-24 14:54:32,328 INFO L78 Accepts]: Start accepts. Automaton has 125606 states and 134938 transitions. Word has length 303 [2018-10-24 14:54:32,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:54:32,328 INFO L481 AbstractCegarLoop]: Abstraction has 125606 states and 134938 transitions. [2018-10-24 14:54:32,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:54:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 125606 states and 134938 transitions. [2018-10-24 14:54:32,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-10-24 14:54:32,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:54:32,347 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:54:32,347 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:54:32,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:54:32,347 INFO L82 PathProgramCache]: Analyzing trace with hash 2106864431, now seen corresponding path program 1 times [2018-10-24 14:54:32,348 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:54:32,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:54:32,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:32,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:32,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:54:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:33,183 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2018-10-24 14:54:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:33,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:54:33,698 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:33,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:54:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:54:33,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:54:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:54:34,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 14:54:34,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3] total 12 [2018-10-24 14:54:34,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 14:54:34,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 14:54:34,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-24 14:54:34,201 INFO L87 Difference]: Start difference. First operand 125606 states and 134938 transitions. Second operand 13 states. [2018-10-24 14:54:35,747 WARN L179 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 30 [2018-10-24 14:54:52,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:54:52,252 INFO L93 Difference]: Finished difference Result 557987 states and 598038 transitions. [2018-10-24 14:54:52,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-24 14:54:52,253 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 305 [2018-10-24 14:54:52,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:54:52,944 INFO L225 Difference]: With dead ends: 557987 [2018-10-24 14:54:52,944 INFO L226 Difference]: Without dead ends: 432383 [2018-10-24 14:54:53,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=281, Invalid=775, Unknown=0, NotChecked=0, Total=1056 [2018-10-24 14:54:53,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432383 states. [2018-10-24 14:55:01,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432383 to 410123. [2018-10-24 14:55:01,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410123 states. [2018-10-24 14:55:02,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410123 states to 410123 states and 436941 transitions. [2018-10-24 14:55:02,034 INFO L78 Accepts]: Start accepts. Automaton has 410123 states and 436941 transitions. Word has length 305 [2018-10-24 14:55:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:02,035 INFO L481 AbstractCegarLoop]: Abstraction has 410123 states and 436941 transitions. [2018-10-24 14:55:02,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 14:55:02,035 INFO L276 IsEmpty]: Start isEmpty. Operand 410123 states and 436941 transitions. [2018-10-24 14:55:02,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-10-24 14:55:02,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:02,103 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,103 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:02,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:02,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1554377472, now seen corresponding path program 1 times [2018-10-24 14:55:02,104 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:02,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:02,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:02,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:02,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:02,452 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 14:55:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-24 14:55:02,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:55:02,641 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:55:02,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:02,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:55:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-24 14:55:02,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:55:02,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 14:55:02,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:55:02,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:55:02,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:55:02,914 INFO L87 Difference]: Start difference. First operand 410123 states and 436941 transitions. Second operand 6 states. [2018-10-24 14:55:17,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:17,949 INFO L93 Difference]: Finished difference Result 1145138 states and 1224839 transitions. [2018-10-24 14:55:17,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 14:55:17,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 311 [2018-10-24 14:55:17,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:18,971 INFO L225 Difference]: With dead ends: 1145138 [2018-10-24 14:55:18,972 INFO L226 Difference]: Without dead ends: 735631 [2018-10-24 14:55:19,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-24 14:55:19,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735631 states. [2018-10-24 14:55:30,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735631 to 687423. [2018-10-24 14:55:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687423 states. [2018-10-24 14:55:31,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687423 states to 687423 states and 729815 transitions. [2018-10-24 14:55:31,405 INFO L78 Accepts]: Start accepts. Automaton has 687423 states and 729815 transitions. Word has length 311 [2018-10-24 14:55:31,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:55:31,405 INFO L481 AbstractCegarLoop]: Abstraction has 687423 states and 729815 transitions. [2018-10-24 14:55:31,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:55:31,405 INFO L276 IsEmpty]: Start isEmpty. Operand 687423 states and 729815 transitions. [2018-10-24 14:55:31,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-10-24 14:55:31,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:31,465 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,465 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:31,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:31,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1662920129, now seen corresponding path program 1 times [2018-10-24 14:55:31,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:31,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:31,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:31,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:31,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:31,900 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-10-24 14:55:31,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:31,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:55:31,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:55:31,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:55:31,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:55:31,901 INFO L87 Difference]: Start difference. First operand 687423 states and 729815 transitions. Second operand 4 states. [2018-10-24 14:55:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:55:48,491 INFO L93 Difference]: Finished difference Result 1357273 states and 1441898 transitions. [2018-10-24 14:55:48,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:55:48,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 377 [2018-10-24 14:55:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:55:49,333 INFO L225 Difference]: With dead ends: 1357273 [2018-10-24 14:55:49,333 INFO L226 Difference]: Without dead ends: 670466 [2018-10-24 14:55:49,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:55:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670466 states. [2018-10-24 14:55:59,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670466 to 662624. [2018-10-24 14:55:59,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662624 states. [2018-10-24 14:56:01,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662624 states to 662624 states and 702576 transitions. [2018-10-24 14:56:01,628 INFO L78 Accepts]: Start accepts. Automaton has 662624 states and 702576 transitions. Word has length 377 [2018-10-24 14:56:01,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:01,628 INFO L481 AbstractCegarLoop]: Abstraction has 662624 states and 702576 transitions. [2018-10-24 14:56:01,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:56:01,628 INFO L276 IsEmpty]: Start isEmpty. Operand 662624 states and 702576 transitions. [2018-10-24 14:56:01,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-10-24 14:56:01,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:01,724 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,725 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:01,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:01,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1633540290, now seen corresponding path program 2 times [2018-10-24 14:56:01,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:01,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:01,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:01,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:01,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-10-24 14:56:02,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:02,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:02,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:56:02,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:56:02,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:02,145 INFO L87 Difference]: Start difference. First operand 662624 states and 702576 transitions. Second operand 4 states. [2018-10-24 14:56:15,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:15,341 INFO L93 Difference]: Finished difference Result 1854870 states and 1963824 transitions. [2018-10-24 14:56:15,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:56:15,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 412 [2018-10-24 14:56:15,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:17,204 INFO L225 Difference]: With dead ends: 1854870 [2018-10-24 14:56:17,204 INFO L226 Difference]: Without dead ends: 1192248 [2018-10-24 14:56:17,553 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:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192248 states. [2018-10-24 14:56:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192248 to 1170534. [2018-10-24 14:56:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170534 states. [2018-10-24 14:56:49,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170534 states to 1170534 states and 1238157 transitions. [2018-10-24 14:56:49,797 INFO L78 Accepts]: Start accepts. Automaton has 1170534 states and 1238157 transitions. Word has length 412 [2018-10-24 14:56:49,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:49,797 INFO L481 AbstractCegarLoop]: Abstraction has 1170534 states and 1238157 transitions. [2018-10-24 14:56:49,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:56:49,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1170534 states and 1238157 transitions. [2018-10-24 14:56:49,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-10-24 14:56:49,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:49,861 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, 4, 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, 2, 2, 2, 2, 2, 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] [2018-10-24 14:56:49,861 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:49,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:49,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1247768010, now seen corresponding path program 1 times [2018-10-24 14:56:49,862 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:49,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:49,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:49,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 14:56:49,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-24 14:56:52,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:52,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:52,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:56:52,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:56:52,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:56:52,098 INFO L87 Difference]: Start difference. First operand 1170534 states and 1238157 transitions. Second operand 3 states. Received shutdown request... [2018-10-24 14:56:59,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:56:59,634 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:56:59,640 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:56:59,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:56:59 BoogieIcfgContainer [2018-10-24 14:56:59,640 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:56:59,641 INFO L168 Benchmark]: Toolchain (without parser) took 200028.62 ms. Allocated memory was 1.5 GB in the beginning and 6.6 GB in the end (delta: 5.1 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -358.2 MB). Peak memory consumption was 4.7 GB. Max. memory is 7.1 GB. [2018-10-24 14:56:59,642 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:59,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1166.35 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:56:59,643 INFO L168 Benchmark]: Boogie Procedure Inliner took 309.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -873.0 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-24 14:56:59,644 INFO L168 Benchmark]: Boogie Preprocessor took 113.54 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: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2018-10-24 14:56:59,645 INFO L168 Benchmark]: RCFGBuilder took 5639.81 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 255.7 MB). Peak memory consumption was 255.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:56:59,645 INFO L168 Benchmark]: TraceAbstraction took 192794.77 ms. Allocated memory was 2.3 GB in the beginning and 6.6 GB in the end (delta: 4.3 GB). Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 157.9 MB). Peak memory consumption was 4.5 GB. Max. memory is 7.1 GB. [2018-10-24 14:56:59,655 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 1166.35 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 309.56 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -873.0 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.54 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: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5639.81 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 255.7 MB). Peak memory consumption was 255.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192794.77 ms. Allocated memory was 2.3 GB in the beginning and 6.6 GB in the end (delta: 4.3 GB). Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 157.9 MB). Peak memory consumption was 4.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1527]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1527). Cancelled while BasicCegarLoop was constructing difference of abstraction (1170534states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (1178934 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 192.7s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 109.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4749 SDtfs, 17103 SDslu, 3203 SDs, 0 SdLazy, 26032 SolverSat, 5018 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 712 GetRequests, 640 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1170534occurred in iteration=19, 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: 72.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 110258 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 5823 NumberOfCodeBlocks, 5823 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 5801 ConstructedInterpolants, 0 QuantifiedInterpolants, 5517162 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1023 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 3170/3452 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown