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_label54_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 18:57:04,257 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:57:04,260 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:57:04,280 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:57:04,280 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:57:04,281 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:57:04,284 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:57:04,286 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:57:04,289 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:57:04,296 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:57:04,298 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:57:04,299 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:57:04,300 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:57:04,301 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:57:04,302 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:57:04,305 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:57:04,306 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:57:04,308 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:57:04,310 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:57:04,311 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:57:04,312 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:57:04,314 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:57:04,316 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:57:04,316 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:57:04,316 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:57:04,317 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:57:04,318 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:57:04,319 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:57:04,321 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:57:04,322 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:57:04,323 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:57:04,324 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:57:04,324 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:57:04,324 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:57:04,327 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:57:04,327 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:57:04,328 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-23 18:57:04,353 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:57:04,353 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:57:04,355 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:57:04,355 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:57:04,356 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:57:04,356 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:57:04,356 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:57:04,356 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:57:04,357 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:57:04,357 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:57:04,357 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:57:04,357 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:57:04,357 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:57:04,358 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:57:04,359 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:57:04,359 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:57:04,359 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:57:04,359 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:57:04,359 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:57:04,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:57:04,360 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:57:04,360 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:57:04,360 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:57:04,360 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:57:04,361 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:57:04,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:57:04,362 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:57:04,362 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:57:04,412 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:57:04,429 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:57:04,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:57:04,435 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:57:04,435 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:57:04,436 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label54_true-unreach-call.c [2018-10-23 18:57:04,497 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7267f7a13/832de5a9b214498e9630c74276e78d58/FLAG246bd4fde [2018-10-23 18:57:05,148 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:57:05,149 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label54_true-unreach-call.c [2018-10-23 18:57:05,172 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7267f7a13/832de5a9b214498e9630c74276e78d58/FLAG246bd4fde [2018-10-23 18:57:05,192 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7267f7a13/832de5a9b214498e9630c74276e78d58 [2018-10-23 18:57:05,205 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:57:05,207 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:57:05,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:57:05,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:57:05,214 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:57:05,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:57:05" (1/1) ... [2018-10-23 18:57:05,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d35362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:05, skipping insertion in model container [2018-10-23 18:57:05,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:57:05" (1/1) ... [2018-10-23 18:57:05,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:57:05,343 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:57:06,088 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:57:06,093 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:57:06,430 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:57:06,454 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:57:06,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:06 WrapperNode [2018-10-23 18:57:06,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:57:06,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:57:06,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:57:06,457 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:57:06,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:06" (1/1) ... [2018-10-23 18:57:06,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:06" (1/1) ... [2018-10-23 18:57:06,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:57:06,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:57:06,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:57:06,780 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:57:06,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:06" (1/1) ... [2018-10-23 18:57:06,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:06" (1/1) ... [2018-10-23 18:57:06,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:06" (1/1) ... [2018-10-23 18:57:06,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:06" (1/1) ... [2018-10-23 18:57:06,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:06" (1/1) ... [2018-10-23 18:57:06,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:06" (1/1) ... [2018-10-23 18:57:06,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:06" (1/1) ... [2018-10-23 18:57:06,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:57:06,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:57:06,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:57:06,929 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:57:06,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:06" (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-23 18:57:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:57:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:57:07,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:57:12,901 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:57:12,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:57:12 BoogieIcfgContainer [2018-10-23 18:57:12,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:57:12,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:57:12,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:57:12,907 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:57:12,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:57:05" (1/3) ... [2018-10-23 18:57:12,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1cc0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:57:12, skipping insertion in model container [2018-10-23 18:57:12,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:06" (2/3) ... [2018-10-23 18:57:12,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1cc0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:57:12, skipping insertion in model container [2018-10-23 18:57:12,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:57:12" (3/3) ... [2018-10-23 18:57:12,911 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label54_true-unreach-call.c [2018-10-23 18:57:12,922 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:57:12,931 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:57:12,949 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:57:12,988 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:57:12,989 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:57:12,989 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:57:12,990 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:57:12,990 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:57:12,990 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:57:12,990 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:57:12,990 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:57:12,991 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:57:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-23 18:57:13,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-23 18:57:13,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:13,040 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:13,043 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:13,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:13,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2026764838, now seen corresponding path program 1 times [2018-10-23 18:57:13,052 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:13,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:13,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:13,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:13,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:13,828 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-23 18:57:13,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:13,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:57:13,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:57:13,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:57:13,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:57:13,860 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 3 states. [2018-10-23 18:57:16,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:16,103 INFO L93 Difference]: Finished difference Result 832 states and 1481 transitions. [2018-10-23 18:57:16,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:57:16,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2018-10-23 18:57:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:16,130 INFO L225 Difference]: With dead ends: 832 [2018-10-23 18:57:16,130 INFO L226 Difference]: Without dead ends: 525 [2018-10-23 18:57:16,136 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-23 18:57:16,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-10-23 18:57:16,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 511. [2018-10-23 18:57:16,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-10-23 18:57:16,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 878 transitions. [2018-10-23 18:57:16,229 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 878 transitions. Word has length 167 [2018-10-23 18:57:16,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:16,233 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 878 transitions. [2018-10-23 18:57:16,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:57:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 878 transitions. [2018-10-23 18:57:16,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-23 18:57:16,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:16,245 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:16,245 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:16,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:16,246 INFO L82 PathProgramCache]: Analyzing trace with hash 786333897, now seen corresponding path program 1 times [2018-10-23 18:57:16,247 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:16,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:16,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:16,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:16,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:16,545 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:57:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:57:16,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:16,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:57:16,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:57:16,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:57:16,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:16,599 INFO L87 Difference]: Start difference. First operand 511 states and 878 transitions. Second operand 4 states. [2018-10-23 18:57:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:20,390 INFO L93 Difference]: Finished difference Result 1893 states and 3348 transitions. [2018-10-23 18:57:20,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:57:20,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-10-23 18:57:20,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:20,400 INFO L225 Difference]: With dead ends: 1893 [2018-10-23 18:57:20,400 INFO L226 Difference]: Without dead ends: 1384 [2018-10-23 18:57:20,404 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-23 18:57:20,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2018-10-23 18:57:20,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 923. [2018-10-23 18:57:20,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-23 18:57:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-10-23 18:57:20,453 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 173 [2018-10-23 18:57:20,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:20,453 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-10-23 18:57:20,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:57:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-10-23 18:57:20,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-23 18:57:20,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:20,460 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:20,461 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:20,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:20,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2042740050, now seen corresponding path program 1 times [2018-10-23 18:57:20,463 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:20,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:20,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:20,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:20,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:57:20,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:20,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:57:20,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:57:20,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:57:20,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:57:20,769 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 3 states. [2018-10-23 18:57:24,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:24,021 INFO L93 Difference]: Finished difference Result 2673 states and 4434 transitions. [2018-10-23 18:57:24,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:57:24,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-10-23 18:57:24,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:24,032 INFO L225 Difference]: With dead ends: 2673 [2018-10-23 18:57:24,032 INFO L226 Difference]: Without dead ends: 1752 [2018-10-23 18:57:24,035 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-23 18:57:24,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-10-23 18:57:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1750. [2018-10-23 18:57:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-10-23 18:57:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2700 transitions. [2018-10-23 18:57:24,078 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2700 transitions. Word has length 175 [2018-10-23 18:57:24,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:24,078 INFO L481 AbstractCegarLoop]: Abstraction has 1750 states and 2700 transitions. [2018-10-23 18:57:24,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:57:24,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2700 transitions. [2018-10-23 18:57:24,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-23 18:57:24,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:24,084 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:24,084 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:24,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:24,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1636219690, now seen corresponding path program 1 times [2018-10-23 18:57:24,085 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:24,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:24,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:24,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:24,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:24,221 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-23 18:57:24,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:24,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:57:24,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:57:24,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:57:24,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:57:24,223 INFO L87 Difference]: Start difference. First operand 1750 states and 2700 transitions. Second operand 3 states. [2018-10-23 18:57:25,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:25,028 INFO L93 Difference]: Finished difference Result 5231 states and 8078 transitions. [2018-10-23 18:57:25,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:57:25,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2018-10-23 18:57:25,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:25,048 INFO L225 Difference]: With dead ends: 5231 [2018-10-23 18:57:25,048 INFO L226 Difference]: Without dead ends: 3483 [2018-10-23 18:57:25,052 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-23 18:57:25,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3483 states. [2018-10-23 18:57:25,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3483 to 3479. [2018-10-23 18:57:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3479 states. [2018-10-23 18:57:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3479 states to 3479 states and 5369 transitions. [2018-10-23 18:57:25,137 INFO L78 Accepts]: Start accepts. Automaton has 3479 states and 5369 transitions. Word has length 190 [2018-10-23 18:57:25,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:25,138 INFO L481 AbstractCegarLoop]: Abstraction has 3479 states and 5369 transitions. [2018-10-23 18:57:25,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:57:25,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3479 states and 5369 transitions. [2018-10-23 18:57:25,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-23 18:57:25,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:25,146 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:25,146 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:25,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:25,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1371839370, now seen corresponding path program 1 times [2018-10-23 18:57:25,147 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:25,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:25,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:25,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:25,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:25,492 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-23 18:57:25,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:25,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:57:25,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:57:25,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:57:25,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:25,494 INFO L87 Difference]: Start difference. First operand 3479 states and 5369 transitions. Second operand 4 states. [2018-10-23 18:57:28,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:28,416 INFO L93 Difference]: Finished difference Result 13572 states and 21082 transitions. [2018-10-23 18:57:28,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:57:28,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2018-10-23 18:57:28,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:28,457 INFO L225 Difference]: With dead ends: 13572 [2018-10-23 18:57:28,458 INFO L226 Difference]: Without dead ends: 10095 [2018-10-23 18:57:28,465 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-23 18:57:28,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10095 states. [2018-10-23 18:57:28,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10095 to 6751. [2018-10-23 18:57:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6751 states. [2018-10-23 18:57:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6751 states to 6751 states and 9852 transitions. [2018-10-23 18:57:28,617 INFO L78 Accepts]: Start accepts. Automaton has 6751 states and 9852 transitions. Word has length 191 [2018-10-23 18:57:28,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:28,617 INFO L481 AbstractCegarLoop]: Abstraction has 6751 states and 9852 transitions. [2018-10-23 18:57:28,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:57:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 6751 states and 9852 transitions. [2018-10-23 18:57:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-23 18:57:28,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:28,630 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:28,631 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:28,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:28,631 INFO L82 PathProgramCache]: Analyzing trace with hash 2009477225, now seen corresponding path program 1 times [2018-10-23 18:57:28,631 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:28,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:28,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:28,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:28,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:28,786 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-23 18:57:28,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:28,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:57:28,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:57:28,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:57:28,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:57:28,788 INFO L87 Difference]: Start difference. First operand 6751 states and 9852 transitions. Second operand 3 states. [2018-10-23 18:57:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:30,733 INFO L93 Difference]: Finished difference Result 13450 states and 19634 transitions. [2018-10-23 18:57:30,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:57:30,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-10-23 18:57:30,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:30,764 INFO L225 Difference]: With dead ends: 13450 [2018-10-23 18:57:30,765 INFO L226 Difference]: Without dead ends: 6701 [2018-10-23 18:57:30,775 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-23 18:57:30,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6701 states. [2018-10-23 18:57:30,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6701 to 6701. [2018-10-23 18:57:30,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6701 states. [2018-10-23 18:57:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6701 states to 6701 states and 9628 transitions. [2018-10-23 18:57:30,889 INFO L78 Accepts]: Start accepts. Automaton has 6701 states and 9628 transitions. Word has length 205 [2018-10-23 18:57:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:30,890 INFO L481 AbstractCegarLoop]: Abstraction has 6701 states and 9628 transitions. [2018-10-23 18:57:30,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:57:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 6701 states and 9628 transitions. [2018-10-23 18:57:30,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-23 18:57:30,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:30,899 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:30,899 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:30,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:30,900 INFO L82 PathProgramCache]: Analyzing trace with hash -316930978, now seen corresponding path program 1 times [2018-10-23 18:57:30,900 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:30,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:30,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:30,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:30,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:31,146 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-23 18:57:31,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:31,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:57:31,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:57:31,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:57:31,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:57:31,147 INFO L87 Difference]: Start difference. First operand 6701 states and 9628 transitions. Second operand 5 states. [2018-10-23 18:57:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:33,741 INFO L93 Difference]: Finished difference Result 15491 states and 22470 transitions. [2018-10-23 18:57:33,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:57:33,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 207 [2018-10-23 18:57:33,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:33,769 INFO L225 Difference]: With dead ends: 15491 [2018-10-23 18:57:33,770 INFO L226 Difference]: Without dead ends: 8792 [2018-10-23 18:57:33,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:57:33,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8792 states. [2018-10-23 18:57:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8792 to 7109. [2018-10-23 18:57:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7109 states. [2018-10-23 18:57:33,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7109 states to 7109 states and 10120 transitions. [2018-10-23 18:57:33,918 INFO L78 Accepts]: Start accepts. Automaton has 7109 states and 10120 transitions. Word has length 207 [2018-10-23 18:57:33,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:33,918 INFO L481 AbstractCegarLoop]: Abstraction has 7109 states and 10120 transitions. [2018-10-23 18:57:33,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:57:33,919 INFO L276 IsEmpty]: Start isEmpty. Operand 7109 states and 10120 transitions. [2018-10-23 18:57:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-23 18:57:33,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:33,929 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:33,929 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:33,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:33,930 INFO L82 PathProgramCache]: Analyzing trace with hash 265559875, now seen corresponding path program 1 times [2018-10-23 18:57:33,930 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:33,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:33,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:33,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:33,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:34,135 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-23 18:57:34,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:34,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:57:34,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:57:34,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:57:34,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:57:34,136 INFO L87 Difference]: Start difference. First operand 7109 states and 10120 transitions. Second operand 3 states. [2018-10-23 18:57:35,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:35,352 INFO L93 Difference]: Finished difference Result 14222 states and 20249 transitions. [2018-10-23 18:57:35,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:57:35,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2018-10-23 18:57:35,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:35,367 INFO L225 Difference]: With dead ends: 14222 [2018-10-23 18:57:35,367 INFO L226 Difference]: Without dead ends: 7115 [2018-10-23 18:57:35,375 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-23 18:57:35,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2018-10-23 18:57:35,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 7109. [2018-10-23 18:57:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7109 states. [2018-10-23 18:57:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7109 states to 7109 states and 9506 transitions. [2018-10-23 18:57:35,472 INFO L78 Accepts]: Start accepts. Automaton has 7109 states and 9506 transitions. Word has length 208 [2018-10-23 18:57:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:35,472 INFO L481 AbstractCegarLoop]: Abstraction has 7109 states and 9506 transitions. [2018-10-23 18:57:35,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:57:35,472 INFO L276 IsEmpty]: Start isEmpty. Operand 7109 states and 9506 transitions. [2018-10-23 18:57:35,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-23 18:57:35,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:35,483 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:57:35,483 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:35,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:35,484 INFO L82 PathProgramCache]: Analyzing trace with hash -848085893, now seen corresponding path program 1 times [2018-10-23 18:57:35,484 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:35,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:35,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:35,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:35,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:35,603 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-23 18:57:35,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:35,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:57:35,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:57:35,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:57:35,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:57:35,605 INFO L87 Difference]: Start difference. First operand 7109 states and 9506 transitions. Second operand 3 states. [2018-10-23 18:57:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:37,021 INFO L93 Difference]: Finished difference Result 20540 states and 27399 transitions. [2018-10-23 18:57:37,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:57:37,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2018-10-23 18:57:37,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:37,053 INFO L225 Difference]: With dead ends: 20540 [2018-10-23 18:57:37,053 INFO L226 Difference]: Without dead ends: 13433 [2018-10-23 18:57:37,066 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-23 18:57:37,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13433 states. [2018-10-23 18:57:37,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13433 to 13429. [2018-10-23 18:57:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13429 states. [2018-10-23 18:57:37,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13429 states to 13429 states and 16273 transitions. [2018-10-23 18:57:37,257 INFO L78 Accepts]: Start accepts. Automaton has 13429 states and 16273 transitions. Word has length 215 [2018-10-23 18:57:37,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:37,257 INFO L481 AbstractCegarLoop]: Abstraction has 13429 states and 16273 transitions. [2018-10-23 18:57:37,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:57:37,258 INFO L276 IsEmpty]: Start isEmpty. Operand 13429 states and 16273 transitions. [2018-10-23 18:57:37,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-23 18:57:37,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:37,275 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-23 18:57:37,275 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:37,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:37,276 INFO L82 PathProgramCache]: Analyzing trace with hash 851575128, now seen corresponding path program 1 times [2018-10-23 18:57:37,276 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:37,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:37,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:37,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:37,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-23 18:57:37,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:37,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:57:37,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:57:37,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:57:37,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:57:37,445 INFO L87 Difference]: Start difference. First operand 13429 states and 16273 transitions. Second operand 3 states. [2018-10-23 18:57:38,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:38,885 INFO L93 Difference]: Finished difference Result 32364 states and 39837 transitions. [2018-10-23 18:57:38,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:57:38,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2018-10-23 18:57:38,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:38,911 INFO L225 Difference]: With dead ends: 32364 [2018-10-23 18:57:38,911 INFO L226 Difference]: Without dead ends: 18937 [2018-10-23 18:57:38,927 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-23 18:57:38,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18937 states. [2018-10-23 18:57:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18937 to 18937. [2018-10-23 18:57:39,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18937 states. [2018-10-23 18:57:39,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18937 states to 18937 states and 22202 transitions. [2018-10-23 18:57:39,287 INFO L78 Accepts]: Start accepts. Automaton has 18937 states and 22202 transitions. Word has length 240 [2018-10-23 18:57:39,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:39,288 INFO L481 AbstractCegarLoop]: Abstraction has 18937 states and 22202 transitions. [2018-10-23 18:57:39,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:57:39,288 INFO L276 IsEmpty]: Start isEmpty. Operand 18937 states and 22202 transitions. [2018-10-23 18:57:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-23 18:57:39,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:39,313 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:57:39,313 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:39,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:39,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1358554894, now seen corresponding path program 1 times [2018-10-23 18:57:39,314 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:39,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:39,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:39,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:39,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:57:39,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:39,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:57:39,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:57:39,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:57:39,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:57:39,629 INFO L87 Difference]: Start difference. First operand 18937 states and 22202 transitions. Second operand 3 states. [2018-10-23 18:57:41,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:41,587 INFO L93 Difference]: Finished difference Result 51134 states and 59623 transitions. [2018-10-23 18:57:41,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:57:41,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2018-10-23 18:57:41,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:41,639 INFO L225 Difference]: With dead ends: 51134 [2018-10-23 18:57:41,640 INFO L226 Difference]: Without dead ends: 32199 [2018-10-23 18:57:41,669 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-23 18:57:41,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32199 states. [2018-10-23 18:57:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32199 to 32186. [2018-10-23 18:57:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32186 states. [2018-10-23 18:57:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32186 states to 32186 states and 36762 transitions. [2018-10-23 18:57:42,159 INFO L78 Accepts]: Start accepts. Automaton has 32186 states and 36762 transitions. Word has length 242 [2018-10-23 18:57:42,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:42,159 INFO L481 AbstractCegarLoop]: Abstraction has 32186 states and 36762 transitions. [2018-10-23 18:57:42,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:57:42,160 INFO L276 IsEmpty]: Start isEmpty. Operand 32186 states and 36762 transitions. [2018-10-23 18:57:42,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-23 18:57:42,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:42,189 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:57:42,189 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:42,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:42,190 INFO L82 PathProgramCache]: Analyzing trace with hash 2022840628, now seen corresponding path program 1 times [2018-10-23 18:57:42,190 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:42,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:42,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:42,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:42,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:42,796 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:57:42,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:42,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:57:42,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:57:42,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:57:42,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:42,798 INFO L87 Difference]: Start difference. First operand 32186 states and 36762 transitions. Second operand 4 states. [2018-10-23 18:57:44,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:44,722 INFO L93 Difference]: Finished difference Result 123822 states and 141274 transitions. [2018-10-23 18:57:44,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:57:44,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 299 [2018-10-23 18:57:44,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:45,171 INFO L225 Difference]: With dead ends: 123822 [2018-10-23 18:57:45,171 INFO L226 Difference]: Without dead ends: 91638 [2018-10-23 18:57:45,194 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-23 18:57:45,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91638 states. [2018-10-23 18:57:45,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91638 to 60068. [2018-10-23 18:57:45,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60068 states. [2018-10-23 18:57:45,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60068 states to 60068 states and 68482 transitions. [2018-10-23 18:57:45,911 INFO L78 Accepts]: Start accepts. Automaton has 60068 states and 68482 transitions. Word has length 299 [2018-10-23 18:57:45,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:45,911 INFO L481 AbstractCegarLoop]: Abstraction has 60068 states and 68482 transitions. [2018-10-23 18:57:45,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:57:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 60068 states and 68482 transitions. [2018-10-23 18:57:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-10-23 18:57:45,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:45,936 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, 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] [2018-10-23 18:57:45,937 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:45,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:45,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1719401463, now seen corresponding path program 1 times [2018-10-23 18:57:45,937 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:45,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:45,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:45,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:45,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:46,512 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-23 18:57:46,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:46,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:57:46,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:57:46,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:57:46,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:46,514 INFO L87 Difference]: Start difference. First operand 60068 states and 68482 transitions. Second operand 4 states. [2018-10-23 18:57:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:50,123 INFO L93 Difference]: Finished difference Result 174867 states and 199207 transitions. [2018-10-23 18:57:50,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:57:50,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 321 [2018-10-23 18:57:50,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:50,233 INFO L225 Difference]: With dead ends: 174867 [2018-10-23 18:57:50,233 INFO L226 Difference]: Without dead ends: 114801 [2018-10-23 18:57:50,263 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-23 18:57:50,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114801 states. [2018-10-23 18:57:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114801 to 114799. [2018-10-23 18:57:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114799 states. [2018-10-23 18:57:51,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114799 states to 114799 states and 130705 transitions. [2018-10-23 18:57:51,466 INFO L78 Accepts]: Start accepts. Automaton has 114799 states and 130705 transitions. Word has length 321 [2018-10-23 18:57:51,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:57:51,466 INFO L481 AbstractCegarLoop]: Abstraction has 114799 states and 130705 transitions. [2018-10-23 18:57:51,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:57:51,466 INFO L276 IsEmpty]: Start isEmpty. Operand 114799 states and 130705 transitions. [2018-10-23 18:57:51,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-10-23 18:57:51,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:57:51,514 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-23 18:57:51,514 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:57:51,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:57:51,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2077519843, now seen corresponding path program 1 times [2018-10-23 18:57:51,514 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:57:51,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:57:51,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:51,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:57:51,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:57:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:57:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-10-23 18:57:51,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:57:51,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:57:51,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:57:51,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:57:51,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:51,964 INFO L87 Difference]: Start difference. First operand 114799 states and 130705 transitions. Second operand 4 states. [2018-10-23 18:57:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:57:56,599 INFO L93 Difference]: Finished difference Result 434593 states and 493616 transitions. [2018-10-23 18:57:56,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:57:56,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 395 [2018-10-23 18:57:56,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:57:56,974 INFO L225 Difference]: With dead ends: 434593 [2018-10-23 18:57:56,974 INFO L226 Difference]: Without dead ends: 319796 [2018-10-23 18:57:57,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:57:57,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319796 states. [2018-10-23 18:58:01,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319796 to 319784. [2018-10-23 18:58:01,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319784 states. [2018-10-23 18:58:01,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319784 states to 319784 states and 362577 transitions. [2018-10-23 18:58:01,408 INFO L78 Accepts]: Start accepts. Automaton has 319784 states and 362577 transitions. Word has length 395 [2018-10-23 18:58:01,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:58:01,408 INFO L481 AbstractCegarLoop]: Abstraction has 319784 states and 362577 transitions. [2018-10-23 18:58:01,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:58:01,408 INFO L276 IsEmpty]: Start isEmpty. Operand 319784 states and 362577 transitions. [2018-10-23 18:58:01,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-10-23 18:58:01,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:58:01,515 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:58:01,515 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:58:01,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:58:01,515 INFO L82 PathProgramCache]: Analyzing trace with hash 561179551, now seen corresponding path program 1 times [2018-10-23 18:58:01,516 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:58:01,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:58:01,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:01,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:01,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:03,874 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-10-23 18:58:03,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:58:03,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:58:03,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:58:03,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:58:03,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:58:03,877 INFO L87 Difference]: Start difference. First operand 319784 states and 362577 transitions. Second operand 4 states. [2018-10-23 18:58:07,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:58:07,131 INFO L93 Difference]: Finished difference Result 621108 states and 705073 transitions. [2018-10-23 18:58:07,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:58:07,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 456 [2018-10-23 18:58:07,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:58:07,514 INFO L225 Difference]: With dead ends: 621108 [2018-10-23 18:58:07,515 INFO L226 Difference]: Without dead ends: 301326 [2018-10-23 18:58:07,699 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-23 18:58:07,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301326 states. [2018-10-23 18:58:19,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301326 to 301326. [2018-10-23 18:58:19,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301326 states. [2018-10-23 18:58:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301326 states to 301326 states and 330065 transitions. [2018-10-23 18:58:19,750 INFO L78 Accepts]: Start accepts. Automaton has 301326 states and 330065 transitions. Word has length 456 [2018-10-23 18:58:19,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:58:19,751 INFO L481 AbstractCegarLoop]: Abstraction has 301326 states and 330065 transitions. [2018-10-23 18:58:19,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:58:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 301326 states and 330065 transitions. [2018-10-23 18:58:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-10-23 18:58:19,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:58:19,859 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-23 18:58:19,859 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:58:19,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:58:19,859 INFO L82 PathProgramCache]: Analyzing trace with hash -190490305, now seen corresponding path program 1 times [2018-10-23 18:58:19,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:58:19,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:58:19,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:19,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:19,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-10-23 18:58:20,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:58:20,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:58:20,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:58:20,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:58:20,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:58:20,409 INFO L87 Difference]: Start difference. First operand 301326 states and 330065 transitions. Second operand 4 states. [2018-10-23 18:58:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:58:24,635 INFO L93 Difference]: Finished difference Result 598467 states and 655778 transitions. [2018-10-23 18:58:24,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:58:24,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 510 [2018-10-23 18:58:24,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:58:24,978 INFO L225 Difference]: With dead ends: 598467 [2018-10-23 18:58:24,978 INFO L226 Difference]: Without dead ends: 297143 [2018-10-23 18:58:25,115 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-23 18:58:25,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297143 states. [2018-10-23 18:58:29,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297143 to 297021. [2018-10-23 18:58:29,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297021 states. [2018-10-23 18:58:30,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297021 states to 297021 states and 323925 transitions. [2018-10-23 18:58:30,188 INFO L78 Accepts]: Start accepts. Automaton has 297021 states and 323925 transitions. Word has length 510 [2018-10-23 18:58:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:58:30,189 INFO L481 AbstractCegarLoop]: Abstraction has 297021 states and 323925 transitions. [2018-10-23 18:58:30,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:58:30,189 INFO L276 IsEmpty]: Start isEmpty. Operand 297021 states and 323925 transitions. [2018-10-23 18:58:30,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2018-10-23 18:58:30,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:58:30,271 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:58:30,271 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:58:30,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:58:30,272 INFO L82 PathProgramCache]: Analyzing trace with hash -2037807737, now seen corresponding path program 1 times [2018-10-23 18:58:30,272 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:58:30,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:58:30,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:30,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:30,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2018-10-23 18:58:30,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:58:30,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:58:30,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:58:30,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:58:30,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:58:30,835 INFO L87 Difference]: Start difference. First operand 297021 states and 323925 transitions. Second operand 5 states. [2018-10-23 18:58:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:58:35,917 INFO L93 Difference]: Finished difference Result 743526 states and 807587 transitions. [2018-10-23 18:58:35,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:58:35,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 511 [2018-10-23 18:58:35,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:58:36,479 INFO L225 Difference]: With dead ends: 743526 [2018-10-23 18:58:36,479 INFO L226 Difference]: Without dead ends: 446507 [2018-10-23 18:58:36,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:58:37,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446507 states. [2018-10-23 18:58:48,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446507 to 438054. [2018-10-23 18:58:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438054 states. [2018-10-23 18:58:49,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438054 states to 438054 states and 474625 transitions. [2018-10-23 18:58:49,338 INFO L78 Accepts]: Start accepts. Automaton has 438054 states and 474625 transitions. Word has length 511 [2018-10-23 18:58:49,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:58:49,339 INFO L481 AbstractCegarLoop]: Abstraction has 438054 states and 474625 transitions. [2018-10-23 18:58:49,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:58:49,339 INFO L276 IsEmpty]: Start isEmpty. Operand 438054 states and 474625 transitions. [2018-10-23 18:58:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-10-23 18:58:49,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:58:49,463 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-23 18:58:49,464 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:58:49,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:58:49,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1770415728, now seen corresponding path program 1 times [2018-10-23 18:58:49,464 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:58:49,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:58:49,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:49,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:58:49,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:58:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:58:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-10-23 18:58:49,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:58:49,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:58:49,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:58:49,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:58:49,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:58:49,921 INFO L87 Difference]: Start difference. First operand 438054 states and 474625 transitions. Second operand 4 states. [2018-10-23 18:58:55,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:58:55,315 INFO L93 Difference]: Finished difference Result 891977 states and 967142 transitions. [2018-10-23 18:58:55,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:58:55,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 538 [2018-10-23 18:58:55,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:58:57,328 INFO L225 Difference]: With dead ends: 891977 [2018-10-23 18:58:57,328 INFO L226 Difference]: Without dead ends: 443675 [2018-10-23 18:58:57,536 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-23 18:58:57,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443675 states. [2018-10-23 18:59:03,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443675 to 433741. [2018-10-23 18:59:03,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433741 states. [2018-10-23 18:59:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433741 states to 433741 states and 464883 transitions. [2018-10-23 18:59:04,031 INFO L78 Accepts]: Start accepts. Automaton has 433741 states and 464883 transitions. Word has length 538 [2018-10-23 18:59:04,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:59:04,031 INFO L481 AbstractCegarLoop]: Abstraction has 433741 states and 464883 transitions. [2018-10-23 18:59:04,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:59:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 433741 states and 464883 transitions. [2018-10-23 18:59:04,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2018-10-23 18:59:04,164 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:59:04,165 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:59:04,165 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:59:04,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:59:04,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1715072247, now seen corresponding path program 1 times [2018-10-23 18:59:04,166 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:59:04,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:59:04,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:04,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:59:04,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:59:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:59:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 383 proven. 5 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2018-10-23 18:59:05,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:59:05,883 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-23 18:59:05,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:59:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:59:06,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:59:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2018-10-23 18:59:06,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:59:06,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2018-10-23 18:59:06,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:59:06,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:59:06,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:59:06,478 INFO L87 Difference]: Start difference. First operand 433741 states and 464883 transitions. Second operand 5 states. [2018-10-23 18:59:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:59:23,298 INFO L93 Difference]: Finished difference Result 2158867 states and 2304797 transitions. [2018-10-23 18:59:23,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 18:59:23,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 551 [2018-10-23 18:59:23,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:59:26,130 INFO L225 Difference]: With dead ends: 2158867 [2018-10-23 18:59:26,131 INFO L226 Difference]: Without dead ends: 1725128 [2018-10-23 18:59:26,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 550 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-23 18:59:28,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725128 states. [2018-10-23 18:59:51,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725128 to 1135472. [2018-10-23 18:59:51,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135472 states. [2018-10-23 19:00:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135472 states to 1135472 states and 1213328 transitions. [2018-10-23 19:00:11,912 INFO L78 Accepts]: Start accepts. Automaton has 1135472 states and 1213328 transitions. Word has length 551 [2018-10-23 19:00:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 19:00:11,912 INFO L481 AbstractCegarLoop]: Abstraction has 1135472 states and 1213328 transitions. [2018-10-23 19:00:11,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 19:00:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1135472 states and 1213328 transitions. [2018-10-23 19:00:12,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-10-23 19:00:12,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 19:00:12,212 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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-23 19:00:12,212 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 19:00:12,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 19:00:12,213 INFO L82 PathProgramCache]: Analyzing trace with hash 109418730, now seen corresponding path program 1 times [2018-10-23 19:00:12,213 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 19:00:12,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 19:00:12,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 19:00:12,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 19:00:12,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 19:00:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 19:00:12,741 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-23 19:00:12,958 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-10-23 19:00:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 538 proven. 79 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-10-23 19:00:14,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 19:00:14,096 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-23 19:00:14,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 19:00:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 19:00:14,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 19:00:14,864 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 653 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-10-23 19:00:14,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 19:00:14,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-10-23 19:00:14,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-23 19:00:14,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-23 19:00:14,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-23 19:00:14,889 INFO L87 Difference]: Start difference. First operand 1135472 states and 1213328 transitions. Second operand 10 states. Received shutdown request... [2018-10-23 19:00:20,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-23 19:00:20,999 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 19:00:21,005 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 19:00:21,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 07:00:21 BoogieIcfgContainer [2018-10-23 19:00:21,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 19:00:21,007 INFO L168 Benchmark]: Toolchain (without parser) took 195801.06 ms. Allocated memory was 1.5 GB in the beginning and 7.1 GB in the end (delta: 5.6 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 3.7 GB. Max. memory is 7.1 GB. [2018-10-23 19:00:21,008 INFO L168 Benchmark]: CDTParser took 0.24 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-23 19:00:21,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1247.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-23 19:00:21,009 INFO L168 Benchmark]: Boogie Procedure Inliner took 322.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -879.2 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-23 19:00:21,010 INFO L168 Benchmark]: Boogie Preprocessor took 148.33 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-10-23 19:00:21,011 INFO L168 Benchmark]: RCFGBuilder took 5973.77 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: 257.1 MB). Peak memory consumption was 257.1 MB. Max. memory is 7.1 GB. [2018-10-23 19:00:21,012 INFO L168 Benchmark]: TraceAbstraction took 188102.36 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.8 GB). Free memory was 1.9 GB in the beginning and 3.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2018-10-23 19:00:21,017 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1247.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 322.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -879.2 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.33 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5973.77 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: 257.1 MB). Peak memory consumption was 257.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 188102.36 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.8 GB). Free memory was 1.9 GB in the beginning and 3.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1533]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1533). Cancelled while BasicCegarLoop was constructing difference of abstraction (1135472states) and FLOYD_HOARE automaton (currently 19 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (31617 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 188.0s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 83.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4729 SDtfs, 13670 SDslu, 4368 SDs, 0 SdLazy, 18673 SolverSat, 3784 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1217 GetRequests, 1153 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1135472occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 89.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 645280 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 7487 NumberOfCodeBlocks, 7487 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 7465 ConstructedInterpolants, 0 QuantifiedInterpolants, 8496646 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1765 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 7417/7501 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown