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_label05_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:58:01,937 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:58:01,940 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:58:01,953 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:58:01,954 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:58:01,955 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:58:01,958 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:58:01,961 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:58:01,963 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:58:01,970 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:58:01,971 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:58:01,972 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:58:01,975 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:58:01,976 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:58:01,977 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:58:01,981 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:58:01,982 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:58:01,984 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:58:01,986 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:58:01,988 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:58:01,989 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:58:01,990 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:58:01,992 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:58:01,992 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:58:01,993 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:58:01,993 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:58:01,994 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:58:01,995 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:58:01,996 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:58:01,997 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:58:01,997 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:58:01,998 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:58:01,998 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:58:01,998 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:58:01,999 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:58:02,000 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:58:02,000 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-26 19:58:02,022 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:58:02,023 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:58:02,023 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:58:02,024 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:58:02,025 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:58:02,025 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:58:02,026 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:58:02,026 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:58:02,026 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:58:02,026 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:58:02,026 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:58:02,026 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:58:02,028 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:58:02,028 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:58:02,028 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:58:02,028 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:58:02,029 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:58:02,029 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:58:02,029 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:58:02,029 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:58:02,029 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:58:02,029 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:58:02,031 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:58:02,031 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 19:58:02,031 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:58:02,032 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:58:02,032 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:58:02,032 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 19:58:02,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:58:02,097 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:58:02,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:58:02,103 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:58:02,103 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:58:02,104 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label05_true-unreach-call.c [2018-10-26 19:58:02,181 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/09add04c8/f9d42a7d13994537a9e10ee9c75b2671/FLAGd12d9a8b8 [2018-10-26 19:58:02,879 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:58:02,880 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label05_true-unreach-call.c [2018-10-26 19:58:02,899 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/09add04c8/f9d42a7d13994537a9e10ee9c75b2671/FLAGd12d9a8b8 [2018-10-26 19:58:02,914 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/09add04c8/f9d42a7d13994537a9e10ee9c75b2671 [2018-10-26 19:58:02,924 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:58:02,926 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:58:02,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:58:02,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:58:02,931 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:58:02,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:58:02" (1/1) ... [2018-10-26 19:58:02,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@618e506f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:02, skipping insertion in model container [2018-10-26 19:58:02,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:58:02" (1/1) ... [2018-10-26 19:58:02,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:58:03,028 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:58:03,817 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:58:03,822 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:58:04,130 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:58:04,154 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:58:04,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:04 WrapperNode [2018-10-26 19:58:04,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:58:04,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:58:04,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:58:04,158 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:58:04,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:04" (1/1) ... [2018-10-26 19:58:04,208 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:04" (1/1) ... [2018-10-26 19:58:04,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:58:04,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:58:04,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:58:04,449 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:58:04,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:04" (1/1) ... [2018-10-26 19:58:04,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:04" (1/1) ... [2018-10-26 19:58:04,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:04" (1/1) ... [2018-10-26 19:58:04,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:04" (1/1) ... [2018-10-26 19:58:04,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:04" (1/1) ... [2018-10-26 19:58:04,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:04" (1/1) ... [2018-10-26 19:58:04,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:04" (1/1) ... [2018-10-26 19:58:04,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:58:04,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:58:04,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:58:04,594 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:58:04,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:04" (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-26 19:58:04,669 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:58:04,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:58:04,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:58:10,156 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:58:10,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:58:10 BoogieIcfgContainer [2018-10-26 19:58:10,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:58:10,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:58:10,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:58:10,162 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:58:10,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:58:02" (1/3) ... [2018-10-26 19:58:10,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687fac15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:58:10, skipping insertion in model container [2018-10-26 19:58:10,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:04" (2/3) ... [2018-10-26 19:58:10,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687fac15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:58:10, skipping insertion in model container [2018-10-26 19:58:10,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:58:10" (3/3) ... [2018-10-26 19:58:10,166 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label05_true-unreach-call.c [2018-10-26 19:58:10,174 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:58:10,183 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:58:10,201 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:58:10,250 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:58:10,251 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:58:10,251 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:58:10,251 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:58:10,251 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:58:10,251 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:58:10,252 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:58:10,252 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:58:10,252 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:58:10,278 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 19:58:10,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-26 19:58:10,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:10,296 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] [2018-10-26 19:58:10,299 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:10,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:10,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1384220858, now seen corresponding path program 1 times [2018-10-26 19:58:10,306 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:10,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:10,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:10,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:10,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:11,192 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-26 19:58:11,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:11,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:11,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:11,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:11,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:11,222 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-26 19:58:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:15,228 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-10-26 19:58:15,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:15,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-10-26 19:58:15,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:15,254 INFO L225 Difference]: With dead ends: 1075 [2018-10-26 19:58:15,254 INFO L226 Difference]: Without dead ends: 765 [2018-10-26 19:58:15,259 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-26 19:58:15,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-10-26 19:58:15,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-10-26 19:58:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-26 19:58:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-10-26 19:58:15,344 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 159 [2018-10-26 19:58:15,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:15,346 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-10-26 19:58:15,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:15,346 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-10-26 19:58:15,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-26 19:58:15,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:15,352 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] [2018-10-26 19:58:15,352 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:15,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:15,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1142249947, now seen corresponding path program 1 times [2018-10-26 19:58:15,353 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:15,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:15,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:15,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:15,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:15,515 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-26 19:58:15,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:15,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:15,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:15,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:15,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:15,519 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-10-26 19:58:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:17,576 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-10-26 19:58:17,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:17,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2018-10-26 19:58:17,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:17,583 INFO L225 Difference]: With dead ends: 1465 [2018-10-26 19:58:17,583 INFO L226 Difference]: Without dead ends: 947 [2018-10-26 19:58:17,588 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-26 19:58:17,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-10-26 19:58:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-10-26 19:58:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-26 19:58:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-10-26 19:58:17,651 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 168 [2018-10-26 19:58:17,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:17,652 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-10-26 19:58:17,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-10-26 19:58:17,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-26 19:58:17,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:17,664 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:17,665 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:17,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:17,666 INFO L82 PathProgramCache]: Analyzing trace with hash -721058890, now seen corresponding path program 1 times [2018-10-26 19:58:17,667 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:17,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:17,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:17,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:17,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 19:58:17,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:17,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:17,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:17,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:17,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:17,830 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-10-26 19:58:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:20,025 INFO L93 Difference]: Finished difference Result 2774 states and 4502 transitions. [2018-10-26 19:58:20,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:20,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-10-26 19:58:20,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:20,038 INFO L225 Difference]: With dead ends: 2774 [2018-10-26 19:58:20,038 INFO L226 Difference]: Without dead ends: 1845 [2018-10-26 19:58:20,041 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-26 19:58:20,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2018-10-26 19:58:20,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1841. [2018-10-26 19:58:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1841 states. [2018-10-26 19:58:20,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2985 transitions. [2018-10-26 19:58:20,097 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2985 transitions. Word has length 182 [2018-10-26 19:58:20,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:20,097 INFO L481 AbstractCegarLoop]: Abstraction has 1841 states and 2985 transitions. [2018-10-26 19:58:20,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:20,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2985 transitions. [2018-10-26 19:58:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-26 19:58:20,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:20,103 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] [2018-10-26 19:58:20,103 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:20,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:20,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2043591850, now seen corresponding path program 1 times [2018-10-26 19:58:20,104 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:20,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:20,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:20,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:20,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:20,380 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-26 19:58:20,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:20,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:20,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:20,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:20,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:20,382 INFO L87 Difference]: Start difference. First operand 1841 states and 2985 transitions. Second operand 4 states. [2018-10-26 19:58:24,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:24,157 INFO L93 Difference]: Finished difference Result 7028 states and 11557 transitions. [2018-10-26 19:58:24,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:24,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-10-26 19:58:24,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:24,186 INFO L225 Difference]: With dead ends: 7028 [2018-10-26 19:58:24,187 INFO L226 Difference]: Without dead ends: 5189 [2018-10-26 19:58:24,191 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-26 19:58:24,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2018-10-26 19:58:24,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 3481. [2018-10-26 19:58:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3481 states. [2018-10-26 19:58:24,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3481 states to 3481 states and 5332 transitions. [2018-10-26 19:58:24,289 INFO L78 Accepts]: Start accepts. Automaton has 3481 states and 5332 transitions. Word has length 183 [2018-10-26 19:58:24,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:24,290 INFO L481 AbstractCegarLoop]: Abstraction has 3481 states and 5332 transitions. [2018-10-26 19:58:24,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:24,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3481 states and 5332 transitions. [2018-10-26 19:58:24,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-26 19:58:24,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:24,297 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:24,298 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:24,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:24,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1105939895, now seen corresponding path program 1 times [2018-10-26 19:58:24,298 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:24,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:24,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:24,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:24,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:24,528 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 19:58:24,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:24,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:24,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:24,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:24,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:24,531 INFO L87 Difference]: Start difference. First operand 3481 states and 5332 transitions. Second operand 3 states. [2018-10-26 19:58:25,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:25,212 INFO L93 Difference]: Finished difference Result 6910 states and 10594 transitions. [2018-10-26 19:58:25,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:25,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2018-10-26 19:58:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:25,227 INFO L225 Difference]: With dead ends: 6910 [2018-10-26 19:58:25,228 INFO L226 Difference]: Without dead ends: 3431 [2018-10-26 19:58:25,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:25,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3431 states. [2018-10-26 19:58:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3431 to 3431. [2018-10-26 19:58:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3431 states. [2018-10-26 19:58:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3431 states to 3431 states and 5172 transitions. [2018-10-26 19:58:25,298 INFO L78 Accepts]: Start accepts. Automaton has 3431 states and 5172 transitions. Word has length 197 [2018-10-26 19:58:25,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:25,299 INFO L481 AbstractCegarLoop]: Abstraction has 3431 states and 5172 transitions. [2018-10-26 19:58:25,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:25,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3431 states and 5172 transitions. [2018-10-26 19:58:25,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-26 19:58:25,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:25,305 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:25,305 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:25,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:25,306 INFO L82 PathProgramCache]: Analyzing trace with hash 184830782, now seen corresponding path program 1 times [2018-10-26 19:58:25,306 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:25,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:25,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:25,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:25,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:25,800 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-26 19:58:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:25,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:25,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:58:25,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:58:25,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:58:25,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:58:25,847 INFO L87 Difference]: Start difference. First operand 3431 states and 5172 transitions. Second operand 5 states. [2018-10-26 19:58:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:28,947 INFO L93 Difference]: Finished difference Result 8133 states and 12410 transitions. [2018-10-26 19:58:28,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:58:28,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 199 [2018-10-26 19:58:28,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:28,966 INFO L225 Difference]: With dead ends: 8133 [2018-10-26 19:58:28,966 INFO L226 Difference]: Without dead ends: 4704 [2018-10-26 19:58:28,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:58:28,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4704 states. [2018-10-26 19:58:29,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4704 to 3839. [2018-10-26 19:58:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3839 states. [2018-10-26 19:58:29,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3839 states to 3839 states and 5746 transitions. [2018-10-26 19:58:29,053 INFO L78 Accepts]: Start accepts. Automaton has 3839 states and 5746 transitions. Word has length 199 [2018-10-26 19:58:29,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:29,053 INFO L481 AbstractCegarLoop]: Abstraction has 3839 states and 5746 transitions. [2018-10-26 19:58:29,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:58:29,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3839 states and 5746 transitions. [2018-10-26 19:58:29,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-26 19:58:29,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:29,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:58:29,059 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:29,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:29,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1707350819, now seen corresponding path program 1 times [2018-10-26 19:58:29,060 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:29,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:29,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:29,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:29,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:58:29,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:29,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:29,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:29,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:29,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:29,203 INFO L87 Difference]: Start difference. First operand 3839 states and 5746 transitions. Second operand 3 states. [2018-10-26 19:58:30,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:30,743 INFO L93 Difference]: Finished difference Result 10952 states and 16371 transitions. [2018-10-26 19:58:30,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:30,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2018-10-26 19:58:30,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:30,768 INFO L225 Difference]: With dead ends: 10952 [2018-10-26 19:58:30,768 INFO L226 Difference]: Without dead ends: 7115 [2018-10-26 19:58:30,776 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-26 19:58:30,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2018-10-26 19:58:30,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 7109. [2018-10-26 19:58:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7109 states. [2018-10-26 19:58:30,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7109 states to 7109 states and 10002 transitions. [2018-10-26 19:58:30,917 INFO L78 Accepts]: Start accepts. Automaton has 7109 states and 10002 transitions. Word has length 200 [2018-10-26 19:58:30,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:30,917 INFO L481 AbstractCegarLoop]: Abstraction has 7109 states and 10002 transitions. [2018-10-26 19:58:30,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:30,917 INFO L276 IsEmpty]: Start isEmpty. Operand 7109 states and 10002 transitions. [2018-10-26 19:58:30,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-26 19:58:30,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:30,928 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 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] [2018-10-26 19:58:30,928 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:30,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:30,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1058009179, now seen corresponding path program 1 times [2018-10-26 19:58:30,928 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:30,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:30,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:30,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:30,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-26 19:58:31,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:31,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:31,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:31,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:31,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:31,097 INFO L87 Difference]: Start difference. First operand 7109 states and 10002 transitions. Second operand 3 states. [2018-10-26 19:58:32,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:32,864 INFO L93 Difference]: Finished difference Result 20952 states and 29506 transitions. [2018-10-26 19:58:32,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:32,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2018-10-26 19:58:32,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:32,895 INFO L225 Difference]: With dead ends: 20952 [2018-10-26 19:58:32,895 INFO L226 Difference]: Without dead ends: 13845 [2018-10-26 19:58:32,904 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-26 19:58:32,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13845 states. [2018-10-26 19:58:33,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13845 to 13841. [2018-10-26 19:58:33,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13841 states. [2018-10-26 19:58:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13841 states to 13841 states and 17514 transitions. [2018-10-26 19:58:33,086 INFO L78 Accepts]: Start accepts. Automaton has 13841 states and 17514 transitions. Word has length 207 [2018-10-26 19:58:33,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:33,086 INFO L481 AbstractCegarLoop]: Abstraction has 13841 states and 17514 transitions. [2018-10-26 19:58:33,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:33,086 INFO L276 IsEmpty]: Start isEmpty. Operand 13841 states and 17514 transitions. [2018-10-26 19:58:33,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-26 19:58:33,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:33,101 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 19:58:33,102 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:33,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:33,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2125468984, now seen corresponding path program 1 times [2018-10-26 19:58:33,103 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:33,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:33,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:33,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:33,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 19:58:33,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:33,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:33,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:33,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:33,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:33,292 INFO L87 Difference]: Start difference. First operand 13841 states and 17514 transitions. Second operand 3 states. [2018-10-26 19:58:34,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:34,766 INFO L93 Difference]: Finished difference Result 33188 states and 42784 transitions. [2018-10-26 19:58:34,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:34,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2018-10-26 19:58:34,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:34,804 INFO L225 Difference]: With dead ends: 33188 [2018-10-26 19:58:34,804 INFO L226 Difference]: Without dead ends: 19349 [2018-10-26 19:58:34,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19349 states. [2018-10-26 19:58:35,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19349 to 19349. [2018-10-26 19:58:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19349 states. [2018-10-26 19:58:35,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19349 states to 19349 states and 23382 transitions. [2018-10-26 19:58:35,060 INFO L78 Accepts]: Start accepts. Automaton has 19349 states and 23382 transitions. Word has length 228 [2018-10-26 19:58:35,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:35,060 INFO L481 AbstractCegarLoop]: Abstraction has 19349 states and 23382 transitions. [2018-10-26 19:58:35,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:35,060 INFO L276 IsEmpty]: Start isEmpty. Operand 19349 states and 23382 transitions. [2018-10-26 19:58:35,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-26 19:58:35,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:35,083 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:58:35,083 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:35,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:35,083 INFO L82 PathProgramCache]: Analyzing trace with hash -379201010, now seen corresponding path program 1 times [2018-10-26 19:58:35,084 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:35,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:35,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:35,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:35,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-26 19:58:35,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:35,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:35,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:35,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:35,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:35,319 INFO L87 Difference]: Start difference. First operand 19349 states and 23382 transitions. Second operand 4 states. [2018-10-26 19:58:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:37,670 INFO L93 Difference]: Finished difference Result 68561 states and 81633 transitions. [2018-10-26 19:58:37,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:37,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 281 [2018-10-26 19:58:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:37,732 INFO L225 Difference]: With dead ends: 68561 [2018-10-26 19:58:37,732 INFO L226 Difference]: Without dead ends: 49214 [2018-10-26 19:58:37,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:37,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49214 states. [2018-10-26 19:58:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49214 to 35465. [2018-10-26 19:58:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2018-10-26 19:58:38,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 41755 transitions. [2018-10-26 19:58:38,226 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 41755 transitions. Word has length 281 [2018-10-26 19:58:38,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:38,226 INFO L481 AbstractCegarLoop]: Abstraction has 35465 states and 41755 transitions. [2018-10-26 19:58:38,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 41755 transitions. [2018-10-26 19:58:38,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-26 19:58:38,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:38,258 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2018-10-26 19:58:38,258 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:38,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:38,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1671916148, now seen corresponding path program 1 times [2018-10-26 19:58:38,259 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:38,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:38,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:38,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:38,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-26 19:58:38,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:38,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:38,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:38,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:38,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:38,451 INFO L87 Difference]: Start difference. First operand 35465 states and 41755 transitions. Second operand 3 states. [2018-10-26 19:58:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:39,775 INFO L93 Difference]: Finished difference Result 70930 states and 83512 transitions. [2018-10-26 19:58:39,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:39,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2018-10-26 19:58:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:39,814 INFO L225 Difference]: With dead ends: 70930 [2018-10-26 19:58:39,814 INFO L226 Difference]: Without dead ends: 35467 [2018-10-26 19:58:39,840 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-26 19:58:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35467 states. [2018-10-26 19:58:40,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35467 to 35465. [2018-10-26 19:58:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2018-10-26 19:58:40,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 40448 transitions. [2018-10-26 19:58:40,313 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 40448 transitions. Word has length 296 [2018-10-26 19:58:40,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:40,314 INFO L481 AbstractCegarLoop]: Abstraction has 35465 states and 40448 transitions. [2018-10-26 19:58:40,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 40448 transitions. [2018-10-26 19:58:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-26 19:58:40,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:40,607 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:58:40,607 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:40,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:40,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1738833954, now seen corresponding path program 1 times [2018-10-26 19:58:40,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:40,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:40,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:40,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:40,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:41,026 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:58:41,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:41,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:41,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:41,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:41,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:41,028 INFO L87 Difference]: Start difference. First operand 35465 states and 40448 transitions. Second operand 4 states. [2018-10-26 19:58:42,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:42,484 INFO L93 Difference]: Finished difference Result 70937 states and 80912 transitions. [2018-10-26 19:58:42,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:42,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 303 [2018-10-26 19:58:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:42,524 INFO L225 Difference]: With dead ends: 70937 [2018-10-26 19:58:42,524 INFO L226 Difference]: Without dead ends: 35474 [2018-10-26 19:58:42,555 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-26 19:58:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35474 states. [2018-10-26 19:58:42,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35474 to 35465. [2018-10-26 19:58:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2018-10-26 19:58:42,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 40094 transitions. [2018-10-26 19:58:42,973 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 40094 transitions. Word has length 303 [2018-10-26 19:58:42,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:42,974 INFO L481 AbstractCegarLoop]: Abstraction has 35465 states and 40094 transitions. [2018-10-26 19:58:42,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:42,974 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 40094 transitions. [2018-10-26 19:58:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-26 19:58:42,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:42,995 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:58:42,995 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:42,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:42,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1030791003, now seen corresponding path program 1 times [2018-10-26 19:58:42,996 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:42,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:42,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:42,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:42,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:58:43,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:43,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:58:43,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:43,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:43,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:43,398 INFO L87 Difference]: Start difference. First operand 35465 states and 40094 transitions. Second operand 4 states. [2018-10-26 19:58:48,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:48,238 INFO L93 Difference]: Finished difference Result 70932 states and 80192 transitions. [2018-10-26 19:58:48,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:48,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-10-26 19:58:48,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:48,274 INFO L225 Difference]: With dead ends: 70932 [2018-10-26 19:58:48,274 INFO L226 Difference]: Without dead ends: 35469 [2018-10-26 19:58:48,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-26 19:58:48,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35469 states. [2018-10-26 19:58:48,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35469 to 33629. [2018-10-26 19:58:48,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33629 states. [2018-10-26 19:58:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33629 states to 33629 states and 37353 transitions. [2018-10-26 19:58:48,675 INFO L78 Accepts]: Start accepts. Automaton has 33629 states and 37353 transitions. Word has length 308 [2018-10-26 19:58:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:48,676 INFO L481 AbstractCegarLoop]: Abstraction has 33629 states and 37353 transitions. [2018-10-26 19:58:48,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:48,676 INFO L276 IsEmpty]: Start isEmpty. Operand 33629 states and 37353 transitions. [2018-10-26 19:58:48,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-26 19:58:48,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:48,697 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:58:48,697 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:48,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:48,698 INFO L82 PathProgramCache]: Analyzing trace with hash -312509538, now seen corresponding path program 1 times [2018-10-26 19:58:48,698 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:48,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:48,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:48,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:48,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:49,248 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-10-26 19:58:49,425 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 203 proven. 10 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-26 19:58:49,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:58:49,426 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-26 19:58:49,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:49,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:58:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 19:58:49,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:58:49,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-26 19:58:49,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 19:58:49,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 19:58:49,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-10-26 19:58:49,905 INFO L87 Difference]: Start difference. First operand 33629 states and 37353 transitions. Second operand 9 states. [2018-10-26 19:58:50,467 WARN L179 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-10-26 19:58:51,446 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-26 19:59:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:03,735 INFO L93 Difference]: Finished difference Result 206388 states and 228474 transitions. [2018-10-26 19:59:03,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-26 19:59:03,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 382 [2018-10-26 19:59:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:03,924 INFO L225 Difference]: With dead ends: 206388 [2018-10-26 19:59:03,924 INFO L226 Difference]: Without dead ends: 172761 [2018-10-26 19:59:03,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 380 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=201, Invalid=399, Unknown=0, NotChecked=0, Total=600 [2018-10-26 19:59:04,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172761 states. [2018-10-26 19:59:06,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172761 to 103288. [2018-10-26 19:59:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103288 states. [2018-10-26 19:59:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103288 states to 103288 states and 113667 transitions. [2018-10-26 19:59:06,773 INFO L78 Accepts]: Start accepts. Automaton has 103288 states and 113667 transitions. Word has length 382 [2018-10-26 19:59:06,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:06,773 INFO L481 AbstractCegarLoop]: Abstraction has 103288 states and 113667 transitions. [2018-10-26 19:59:06,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 19:59:06,773 INFO L276 IsEmpty]: Start isEmpty. Operand 103288 states and 113667 transitions. [2018-10-26 19:59:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-10-26 19:59:06,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:06,811 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:59:06,811 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:06,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:06,812 INFO L82 PathProgramCache]: Analyzing trace with hash 176335873, now seen corresponding path program 1 times [2018-10-26 19:59:06,812 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:06,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:06,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:06,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:06,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-10-26 19:59:07,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:07,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:59:07,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:59:07,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:59:07,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:59:07,113 INFO L87 Difference]: Start difference. First operand 103288 states and 113667 transitions. Second operand 3 states. [2018-10-26 19:59:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:08,469 INFO L93 Difference]: Finished difference Result 206570 states and 227328 transitions. [2018-10-26 19:59:08,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:59:08,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 417 [2018-10-26 19:59:08,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:08,580 INFO L225 Difference]: With dead ends: 206570 [2018-10-26 19:59:08,580 INFO L226 Difference]: Without dead ends: 103284 [2018-10-26 19:59:08,640 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-26 19:59:08,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103284 states. [2018-10-26 19:59:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103284 to 103284. [2018-10-26 19:59:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103284 states. [2018-10-26 19:59:09,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103284 states to 103284 states and 113657 transitions. [2018-10-26 19:59:09,684 INFO L78 Accepts]: Start accepts. Automaton has 103284 states and 113657 transitions. Word has length 417 [2018-10-26 19:59:09,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:09,685 INFO L481 AbstractCegarLoop]: Abstraction has 103284 states and 113657 transitions. [2018-10-26 19:59:09,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:59:09,685 INFO L276 IsEmpty]: Start isEmpty. Operand 103284 states and 113657 transitions. [2018-10-26 19:59:09,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-10-26 19:59:09,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:09,723 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:59:09,723 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:09,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:09,724 INFO L82 PathProgramCache]: Analyzing trace with hash 105442293, now seen corresponding path program 1 times [2018-10-26 19:59:09,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:09,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:09,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:09,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:09,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-26 19:59:11,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:11,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:59:11,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:11,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:11,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:11,283 INFO L87 Difference]: Start difference. First operand 103284 states and 113657 transitions. Second operand 4 states. [2018-10-26 19:59:14,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:14,113 INFO L93 Difference]: Finished difference Result 386104 states and 424306 transitions. [2018-10-26 19:59:14,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:14,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 418 [2018-10-26 19:59:14,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:14,402 INFO L225 Difference]: With dead ends: 386104 [2018-10-26 19:59:14,402 INFO L226 Difference]: Without dead ends: 282822 [2018-10-26 19:59:14,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:14,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282822 states. [2018-10-26 19:59:17,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282822 to 180154. [2018-10-26 19:59:17,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180154 states. [2018-10-26 19:59:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180154 states to 180154 states and 197738 transitions. [2018-10-26 19:59:17,883 INFO L78 Accepts]: Start accepts. Automaton has 180154 states and 197738 transitions. Word has length 418 [2018-10-26 19:59:17,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:17,883 INFO L481 AbstractCegarLoop]: Abstraction has 180154 states and 197738 transitions. [2018-10-26 19:59:17,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:59:17,884 INFO L276 IsEmpty]: Start isEmpty. Operand 180154 states and 197738 transitions. [2018-10-26 19:59:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-10-26 19:59:17,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:17,910 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:59:17,910 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:17,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:17,910 INFO L82 PathProgramCache]: Analyzing trace with hash 846659115, now seen corresponding path program 1 times [2018-10-26 19:59:17,910 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:17,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:17,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:17,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:17,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2018-10-26 19:59:18,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:18,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:59:18,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:18,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:18,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:18,295 INFO L87 Difference]: Start difference. First operand 180154 states and 197738 transitions. Second operand 4 states. [2018-10-26 19:59:21,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:21,436 INFO L93 Difference]: Finished difference Result 368525 states and 404648 transitions. [2018-10-26 19:59:21,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:21,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2018-10-26 19:59:21,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:21,640 INFO L225 Difference]: With dead ends: 368525 [2018-10-26 19:59:21,640 INFO L226 Difference]: Without dead ends: 188373 [2018-10-26 19:59:21,735 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-26 19:59:21,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188373 states. [2018-10-26 19:59:24,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188373 to 185887. [2018-10-26 19:59:24,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185887 states. [2018-10-26 19:59:25,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185887 states to 185887 states and 203690 transitions. [2018-10-26 19:59:25,128 INFO L78 Accepts]: Start accepts. Automaton has 185887 states and 203690 transitions. Word has length 433 [2018-10-26 19:59:25,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:25,128 INFO L481 AbstractCegarLoop]: Abstraction has 185887 states and 203690 transitions. [2018-10-26 19:59:25,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:59:25,128 INFO L276 IsEmpty]: Start isEmpty. Operand 185887 states and 203690 transitions. [2018-10-26 19:59:25,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-10-26 19:59:25,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:25,153 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:59:25,153 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:25,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:25,154 INFO L82 PathProgramCache]: Analyzing trace with hash 913804750, now seen corresponding path program 1 times [2018-10-26 19:59:25,154 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:25,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:25,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:25,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:25,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:31,074 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 281 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:59:31,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:59:31,075 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-26 19:59:31,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:31,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:59:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:59:31,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:59:31,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-26 19:59:31,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 19:59:31,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 19:59:31,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-10-26 19:59:31,614 INFO L87 Difference]: Start difference. First operand 185887 states and 203690 transitions. Second operand 11 states. [2018-10-26 19:59:48,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:48,775 INFO L93 Difference]: Finished difference Result 658424 states and 722133 transitions. [2018-10-26 19:59:48,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-26 19:59:48,775 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 435 [2018-10-26 19:59:48,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:49,294 INFO L225 Difference]: With dead ends: 658424 [2018-10-26 19:59:49,294 INFO L226 Difference]: Without dead ends: 472539 [2018-10-26 19:59:49,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 456 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=362, Invalid=1044, Unknown=0, NotChecked=0, Total=1406 [2018-10-26 19:59:50,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472539 states. [2018-10-26 19:59:55,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472539 to 462835. [2018-10-26 19:59:55,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462835 states. [2018-10-26 19:59:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462835 states to 462835 states and 503432 transitions. [2018-10-26 19:59:55,831 INFO L78 Accepts]: Start accepts. Automaton has 462835 states and 503432 transitions. Word has length 435 [2018-10-26 19:59:55,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:55,831 INFO L481 AbstractCegarLoop]: Abstraction has 462835 states and 503432 transitions. [2018-10-26 19:59:55,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 19:59:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 462835 states and 503432 transitions. [2018-10-26 19:59:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-10-26 19:59:55,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:55,873 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 19:59:55,873 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:55,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:55,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1716497848, now seen corresponding path program 1 times [2018-10-26 19:59:55,874 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:55,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:55,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:55,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:55,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-10-26 19:59:57,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:57,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:59:57,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:59:57,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:59:57,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:59:57,305 INFO L87 Difference]: Start difference. First operand 462835 states and 503432 transitions. Second operand 3 states. [2018-10-26 20:00:02,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:02,132 INFO L93 Difference]: Finished difference Result 851748 states and 927190 transitions. [2018-10-26 20:00:02,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:00:02,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 464 [2018-10-26 20:00:02,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:02,575 INFO L225 Difference]: With dead ends: 851748 [2018-10-26 20:00:02,576 INFO L226 Difference]: Without dead ends: 388915 [2018-10-26 20:00:02,731 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-26 20:00:02,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388915 states. [2018-10-26 20:00:14,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388915 to 378079. [2018-10-26 20:00:14,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378079 states. [2018-10-26 20:00:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378079 states to 378079 states and 404350 transitions. [2018-10-26 20:00:14,998 INFO L78 Accepts]: Start accepts. Automaton has 378079 states and 404350 transitions. Word has length 464 [2018-10-26 20:00:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:14,998 INFO L481 AbstractCegarLoop]: Abstraction has 378079 states and 404350 transitions. [2018-10-26 20:00:14,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:00:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 378079 states and 404350 transitions. [2018-10-26 20:00:15,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2018-10-26 20:00:15,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:15,032 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-10-26 20:00:15,033 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:15,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:15,033 INFO L82 PathProgramCache]: Analyzing trace with hash -487946110, now seen corresponding path program 1 times [2018-10-26 20:00:15,033 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:15,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:15,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:15,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:15,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 481 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:00:18,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:00:18,621 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:00:18,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:18,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:00:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 624 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-10-26 20:00:19,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:00:19,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 15 [2018-10-26 20:00:19,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 20:00:19,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 20:00:19,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-10-26 20:00:19,445 INFO L87 Difference]: Start difference. First operand 378079 states and 404350 transitions. Second operand 15 states. [2018-10-26 20:00:19,938 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-10-26 20:00:24,083 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-26 20:00:24,586 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-10-26 20:00:33,745 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-10-26 20:00:34,416 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2018-10-26 20:00:35,556 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2018-10-26 20:00:35,782 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-10-26 20:00:37,629 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-10-26 20:00:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:55,258 INFO L93 Difference]: Finished difference Result 1350864 states and 1460939 transitions. [2018-10-26 20:00:55,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-26 20:00:55,259 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 515 [2018-10-26 20:00:55,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:56,228 INFO L225 Difference]: With dead ends: 1350864 [2018-10-26 20:00:56,229 INFO L226 Difference]: Without dead ends: 972787 [2018-10-26 20:00:56,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 571 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1165, Invalid=3665, Unknown=0, NotChecked=0, Total=4830 [2018-10-26 20:00:56,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972787 states. [2018-10-26 20:01:07,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972787 to 683701. [2018-10-26 20:01:07,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683701 states. [2018-10-26 20:01:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683701 states to 683701 states and 727905 transitions. [2018-10-26 20:01:08,501 INFO L78 Accepts]: Start accepts. Automaton has 683701 states and 727905 transitions. Word has length 515 [2018-10-26 20:01:08,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:08,502 INFO L481 AbstractCegarLoop]: Abstraction has 683701 states and 727905 transitions. [2018-10-26 20:01:08,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 20:01:08,502 INFO L276 IsEmpty]: Start isEmpty. Operand 683701 states and 727905 transitions. [2018-10-26 20:01:08,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2018-10-26 20:01:08,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:08,719 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2018-10-26 20:01:08,720 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:08,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:08,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1556115499, now seen corresponding path program 1 times [2018-10-26 20:01:08,720 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:08,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:08,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:08,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:08,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2538 backedges. 785 proven. 0 refuted. 0 times theorem prover too weak. 1753 trivial. 0 not checked. [2018-10-26 20:01:17,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:17,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:01:17,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:01:17,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:01:17,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:17,437 INFO L87 Difference]: Start difference. First operand 683701 states and 727905 transitions. Second operand 4 states. [2018-10-26 20:01:28,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:28,452 INFO L93 Difference]: Finished difference Result 1858843 states and 1977171 transitions. [2018-10-26 20:01:28,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:01:28,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 847 [2018-10-26 20:01:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. Received shutdown request... [2018-10-26 20:01:29,946 INFO L225 Difference]: With dead ends: 1858843 [2018-10-26 20:01:29,947 INFO L226 Difference]: Without dead ends: 1175144 [2018-10-26 20:01:30,269 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-26 20:01:31,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175144 states. [2018-10-26 20:01:31,068 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 20:01:31,072 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 20:01:31,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:01:31 BoogieIcfgContainer [2018-10-26 20:01:31,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:01:31,073 INFO L168 Benchmark]: Toolchain (without parser) took 208148.48 ms. Allocated memory was 1.5 GB in the beginning and 6.1 GB in the end (delta: 4.6 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.5 GB. Max. memory is 7.1 GB. [2018-10-26 20:01:31,074 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 20:01:31,074 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1228.55 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-26 20:01:31,075 INFO L168 Benchmark]: Boogie Procedure Inliner took 290.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -891.7 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. [2018-10-26 20:01:31,077 INFO L168 Benchmark]: Boogie Preprocessor took 144.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-10-26 20:01:31,077 INFO L168 Benchmark]: RCFGBuilder took 5563.50 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: 269.0 MB). Peak memory consumption was 269.0 MB. Max. memory is 7.1 GB. [2018-10-26 20:01:31,078 INFO L168 Benchmark]: TraceAbstraction took 200914.15 ms. Allocated memory was 2.3 GB in the beginning and 6.1 GB in the end (delta: 3.8 GB). Free memory was 1.9 GB in the beginning and 3.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. [2018-10-26 20:01:31,084 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1228.55 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 290.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -891.7 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 144.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5563.50 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: 269.0 MB). Peak memory consumption was 269.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 200914.15 ms. Allocated memory was 2.3 GB in the beginning and 6.1 GB in the end (delta: 3.8 GB). Free memory was 1.9 GB in the beginning and 3.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1509]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1509). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 200.8s OverallTime, 21 OverallIterations, 11 TraceHistogramMax, 126.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5135 SDtfs, 29007 SDslu, 5441 SDs, 0 SdLazy, 43878 SolverSat, 7840 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 73.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1597 GetRequests, 1430 SyntacticMatches, 12 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1983 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=683701occurred in iteration=20, 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: 44.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 502701 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 8154 NumberOfCodeBlocks, 8154 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 8130 ConstructedInterpolants, 0 QuantifiedInterpolants, 15107956 SizeOfPredicates, 21 NumberOfNonLiveVariables, 2191 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 24 InterpolantComputations, 21 PerfectInterpolantSequences, 8160/8591 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown