java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-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_label44_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:59:18,035 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:59:18,037 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:59:18,049 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:59:18,050 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:59:18,051 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:59:18,052 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:59:18,054 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:59:18,056 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:59:18,057 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:59:18,058 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:59:18,058 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:59:18,059 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:59:18,060 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:59:18,061 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:59:18,062 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:59:18,063 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:59:18,065 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:59:18,068 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:59:18,069 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:59:18,071 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:59:18,072 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:59:18,075 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:59:18,075 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:59:18,075 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:59:18,076 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:59:18,077 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:59:18,078 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:59:18,079 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:59:18,080 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:59:18,080 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:59:18,081 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:59:18,082 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:59:18,082 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:59:18,083 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:59:18,084 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:59:18,084 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:59:18,099 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:59:18,100 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:59:18,101 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:59:18,101 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:59:18,101 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:59:18,102 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:59:18,102 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:59:18,102 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:59:18,102 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:59:18,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:59:18,103 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:59:18,103 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:59:18,103 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:59:18,103 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:59:18,103 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:59:18,104 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:59:18,104 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:59:18,104 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:59:18,104 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:59:18,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:59:18,105 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:59:18,105 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:59:18,105 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:59:18,105 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:59:18,105 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:59:18,105 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:59:18,106 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:59:18,106 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:59:18,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:59:18,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:59:18,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:59:18,180 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:59:18,180 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:59:18,181 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label44_true-unreach-call.c [2018-11-06 19:59:18,257 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e27538159/a3677f34c546479fba075aadb93ffd5c/FLAG94c4d0724 [2018-11-06 19:59:18,894 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:59:18,895 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label44_true-unreach-call.c [2018-11-06 19:59:18,918 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e27538159/a3677f34c546479fba075aadb93ffd5c/FLAG94c4d0724 [2018-11-06 19:59:18,942 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e27538159/a3677f34c546479fba075aadb93ffd5c [2018-11-06 19:59:18,952 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:59:18,953 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:59:18,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:59:18,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:59:18,959 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:59:18,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:59:18" (1/1) ... [2018-11-06 19:59:18,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ef9e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:18, skipping insertion in model container [2018-11-06 19:59:18,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:59:18" (1/1) ... [2018-11-06 19:59:18,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:59:19,072 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:59:19,872 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:59:19,878 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:59:20,119 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:59:20,142 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:59:20,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:20 WrapperNode [2018-11-06 19:59:20,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:59:20,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:59:20,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:59:20,144 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:59:20,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:20" (1/1) ... [2018-11-06 19:59:20,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:20" (1/1) ... [2018-11-06 19:59:20,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:59:20,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:59:20,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:59:20,466 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:59:20,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:20" (1/1) ... [2018-11-06 19:59:20,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:20" (1/1) ... [2018-11-06 19:59:20,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:20" (1/1) ... [2018-11-06 19:59:20,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:20" (1/1) ... [2018-11-06 19:59:20,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:20" (1/1) ... [2018-11-06 19:59:20,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:20" (1/1) ... [2018-11-06 19:59:20,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:20" (1/1) ... [2018-11-06 19:59:20,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:59:20,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:59:20,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:59:20,604 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:59:20,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 19:59:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:59:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:59:20,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:59:26,147 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:59:26,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:59:26 BoogieIcfgContainer [2018-11-06 19:59:26,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:59:26,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:59:26,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:59:26,154 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:59:26,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:59:18" (1/3) ... [2018-11-06 19:59:26,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727c94c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:59:26, skipping insertion in model container [2018-11-06 19:59:26,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:20" (2/3) ... [2018-11-06 19:59:26,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727c94c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:59:26, skipping insertion in model container [2018-11-06 19:59:26,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:59:26" (3/3) ... [2018-11-06 19:59:26,158 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label44_true-unreach-call.c [2018-11-06 19:59:26,168 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:59:26,178 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:59:26,195 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:59:26,232 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:59:26,233 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:59:26,233 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:59:26,233 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:59:26,234 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:59:26,234 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:59:26,234 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:59:26,234 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:59:26,234 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:59:26,262 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:59:26,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-06 19:59:26,296 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:26,297 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:26,300 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:26,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:26,307 INFO L82 PathProgramCache]: Analyzing trace with hash -2027933188, now seen corresponding path program 1 times [2018-11-06 19:59:26,308 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:26,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:26,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:26,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:26,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:27,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:27,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:27,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:59:27,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:27,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:27,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:27,372 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-11-06 19:59:30,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:30,857 INFO L93 Difference]: Finished difference Result 1072 states and 1917 transitions. [2018-11-06 19:59:30,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:30,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-11-06 19:59:30,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:30,885 INFO L225 Difference]: With dead ends: 1072 [2018-11-06 19:59:30,886 INFO L226 Difference]: Without dead ends: 762 [2018-11-06 19:59:30,891 INFO L604 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-11-06 19:59:30,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-11-06 19:59:30,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 518. [2018-11-06 19:59:30,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-11-06 19:59:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 855 transitions. [2018-11-06 19:59:30,971 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 855 transitions. Word has length 178 [2018-11-06 19:59:30,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:30,972 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 855 transitions. [2018-11-06 19:59:30,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 855 transitions. [2018-11-06 19:59:30,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-06 19:59:30,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:30,979 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:30,980 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:30,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:30,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1939659693, now seen corresponding path program 1 times [2018-11-06 19:59:30,980 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:30,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:30,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:30,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:30,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:31,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:31,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:59:31,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:31,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:31,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:31,316 INFO L87 Difference]: Start difference. First operand 518 states and 855 transitions. Second operand 4 states. [2018-11-06 19:59:34,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:34,697 INFO L93 Difference]: Finished difference Result 1918 states and 3253 transitions. [2018-11-06 19:59:34,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:34,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-11-06 19:59:34,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:34,707 INFO L225 Difference]: With dead ends: 1918 [2018-11-06 19:59:34,708 INFO L226 Difference]: Without dead ends: 1402 [2018-11-06 19:59:34,712 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:34,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2018-11-06 19:59:34,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 933. [2018-11-06 19:59:34,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-11-06 19:59:34,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1472 transitions. [2018-11-06 19:59:34,757 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1472 transitions. Word has length 184 [2018-11-06 19:59:34,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:34,757 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1472 transitions. [2018-11-06 19:59:34,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:34,757 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1472 transitions. [2018-11-06 19:59:34,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-06 19:59:34,765 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:34,766 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:34,766 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:34,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:34,767 INFO L82 PathProgramCache]: Analyzing trace with hash 177038139, now seen corresponding path program 1 times [2018-11-06 19:59:34,767 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:34,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:34,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:34,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:34,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:34,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:34,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:59:34,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:34,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:34,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:34,884 INFO L87 Difference]: Start difference. First operand 933 states and 1472 transitions. Second operand 3 states. [2018-11-06 19:59:37,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:37,166 INFO L93 Difference]: Finished difference Result 2699 states and 4315 transitions. [2018-11-06 19:59:37,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:37,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2018-11-06 19:59:37,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:37,177 INFO L225 Difference]: With dead ends: 2699 [2018-11-06 19:59:37,177 INFO L226 Difference]: Without dead ends: 1768 [2018-11-06 19:59:37,180 INFO L604 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-11-06 19:59:37,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-11-06 19:59:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1751. [2018-11-06 19:59:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-11-06 19:59:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-11-06 19:59:37,222 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 187 [2018-11-06 19:59:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:37,222 INFO L480 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-11-06 19:59:37,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-11-06 19:59:37,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-06 19:59:37,228 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:37,228 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:37,229 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:37,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:37,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1558635668, now seen corresponding path program 1 times [2018-11-06 19:59:37,229 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:37,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:37,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:37,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:37,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:37,535 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:37,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:37,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:59:37,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:37,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:37,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:37,537 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 4 states. [2018-11-06 19:59:39,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:39,978 INFO L93 Difference]: Finished difference Result 6814 states and 10581 transitions. [2018-11-06 19:59:39,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:39,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2018-11-06 19:59:39,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:40,004 INFO L225 Difference]: With dead ends: 6814 [2018-11-06 19:59:40,004 INFO L226 Difference]: Without dead ends: 5065 [2018-11-06 19:59:40,007 INFO L604 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-11-06 19:59:40,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5065 states. [2018-11-06 19:59:40,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5065 to 3388. [2018-11-06 19:59:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2018-11-06 19:59:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4947 transitions. [2018-11-06 19:59:40,084 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4947 transitions. Word has length 194 [2018-11-06 19:59:40,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:40,084 INFO L480 AbstractCegarLoop]: Abstraction has 3388 states and 4947 transitions. [2018-11-06 19:59:40,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4947 transitions. [2018-11-06 19:59:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-06 19:59:40,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:40,092 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:40,092 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:40,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:40,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1406070287, now seen corresponding path program 1 times [2018-11-06 19:59:40,093 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:40,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:40,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:40,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:40,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:59:40,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:40,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:59:40,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:40,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:40,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:40,337 INFO L87 Difference]: Start difference. First operand 3388 states and 4947 transitions. Second operand 3 states. [2018-11-06 19:59:42,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:42,011 INFO L93 Difference]: Finished difference Result 10057 states and 14733 transitions. [2018-11-06 19:59:42,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:42,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2018-11-06 19:59:42,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:42,040 INFO L225 Difference]: With dead ends: 10057 [2018-11-06 19:59:42,041 INFO L226 Difference]: Without dead ends: 6671 [2018-11-06 19:59:42,047 INFO L604 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-11-06 19:59:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states. [2018-11-06 19:59:42,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 6652. [2018-11-06 19:59:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6652 states. [2018-11-06 19:59:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6652 states to 6652 states and 9399 transitions. [2018-11-06 19:59:42,179 INFO L78 Accepts]: Start accepts. Automaton has 6652 states and 9399 transitions. Word has length 195 [2018-11-06 19:59:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:42,180 INFO L480 AbstractCegarLoop]: Abstraction has 6652 states and 9399 transitions. [2018-11-06 19:59:42,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 6652 states and 9399 transitions. [2018-11-06 19:59:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-06 19:59:42,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:42,199 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:42,199 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:42,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:42,200 INFO L82 PathProgramCache]: Analyzing trace with hash 995862124, now seen corresponding path program 1 times [2018-11-06 19:59:42,200 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:42,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:42,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:42,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:42,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-06 19:59:42,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:42,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:59:42,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:42,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:42,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:42,382 INFO L87 Difference]: Start difference. First operand 6652 states and 9399 transitions. Second operand 3 states. [2018-11-06 19:59:43,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:43,269 INFO L93 Difference]: Finished difference Result 13270 states and 18753 transitions. [2018-11-06 19:59:43,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:43,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2018-11-06 19:59:43,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:43,291 INFO L225 Difference]: With dead ends: 13270 [2018-11-06 19:59:43,292 INFO L226 Difference]: Without dead ends: 6620 [2018-11-06 19:59:43,300 INFO L604 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-11-06 19:59:43,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6620 states. [2018-11-06 19:59:43,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6620 to 6620. [2018-11-06 19:59:43,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6620 states. [2018-11-06 19:59:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6620 states to 6620 states and 9200 transitions. [2018-11-06 19:59:43,432 INFO L78 Accepts]: Start accepts. Automaton has 6620 states and 9200 transitions. Word has length 209 [2018-11-06 19:59:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:43,433 INFO L480 AbstractCegarLoop]: Abstraction has 6620 states and 9200 transitions. [2018-11-06 19:59:43,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 6620 states and 9200 transitions. [2018-11-06 19:59:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-06 19:59:43,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:43,446 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:43,446 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:43,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:43,447 INFO L82 PathProgramCache]: Analyzing trace with hash -362216596, now seen corresponding path program 1 times [2018-11-06 19:59:43,447 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:43,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:43,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:43,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:43,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:43,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:43,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:59:43,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:43,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:43,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:43,666 INFO L87 Difference]: Start difference. First operand 6620 states and 9200 transitions. Second operand 3 states. [2018-11-06 19:59:45,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:45,566 INFO L93 Difference]: Finished difference Result 15495 states and 21391 transitions. [2018-11-06 19:59:45,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:45,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-11-06 19:59:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:45,670 INFO L225 Difference]: With dead ends: 15495 [2018-11-06 19:59:45,670 INFO L226 Difference]: Without dead ends: 8877 [2018-11-06 19:59:45,677 INFO L604 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-11-06 19:59:45,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8877 states. [2018-11-06 19:59:45,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8877 to 8876. [2018-11-06 19:59:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8876 states. [2018-11-06 19:59:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8876 states to 8876 states and 12095 transitions. [2018-11-06 19:59:45,832 INFO L78 Accepts]: Start accepts. Automaton has 8876 states and 12095 transitions. Word has length 220 [2018-11-06 19:59:45,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:45,833 INFO L480 AbstractCegarLoop]: Abstraction has 8876 states and 12095 transitions. [2018-11-06 19:59:45,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:45,833 INFO L276 IsEmpty]: Start isEmpty. Operand 8876 states and 12095 transitions. [2018-11-06 19:59:45,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-06 19:59:45,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:45,850 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:59:45,850 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:45,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:45,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1263477528, now seen corresponding path program 1 times [2018-11-06 19:59:45,851 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:45,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:45,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:45,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:45,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:59:46,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:59:46,184 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 19:59:46,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:46,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:59:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:59:46,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:59:46,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-06 19:59:46,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:59:46,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:59:46,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:59:46,556 INFO L87 Difference]: Start difference. First operand 8876 states and 12095 transitions. Second operand 7 states. [2018-11-06 19:59:52,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:52,188 INFO L93 Difference]: Finished difference Result 29599 states and 39653 transitions. [2018-11-06 19:59:52,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 19:59:52,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 228 [2018-11-06 19:59:52,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:52,225 INFO L225 Difference]: With dead ends: 29599 [2018-11-06 19:59:52,226 INFO L226 Difference]: Without dead ends: 20725 [2018-11-06 19:59:52,236 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-06 19:59:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20725 states. [2018-11-06 19:59:52,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20725 to 20719. [2018-11-06 19:59:52,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20719 states. [2018-11-06 19:59:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20719 states to 20719 states and 23650 transitions. [2018-11-06 19:59:52,516 INFO L78 Accepts]: Start accepts. Automaton has 20719 states and 23650 transitions. Word has length 228 [2018-11-06 19:59:52,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:52,517 INFO L480 AbstractCegarLoop]: Abstraction has 20719 states and 23650 transitions. [2018-11-06 19:59:52,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:59:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 20719 states and 23650 transitions. [2018-11-06 19:59:52,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-06 19:59:52,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:52,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:59:52,547 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:52,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:52,548 INFO L82 PathProgramCache]: Analyzing trace with hash -162429184, now seen corresponding path program 1 times [2018-11-06 19:59:52,548 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:52,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:52,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:52,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:52,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:59:52,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:52,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:59:52,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:52,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:52,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:52,699 INFO L87 Difference]: Start difference. First operand 20719 states and 23650 transitions. Second operand 3 states. [2018-11-06 19:59:54,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:54,375 INFO L93 Difference]: Finished difference Result 40008 states and 45800 transitions. [2018-11-06 19:59:54,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:54,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-11-06 19:59:54,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:54,411 INFO L225 Difference]: With dead ends: 40008 [2018-11-06 19:59:54,412 INFO L226 Difference]: Without dead ends: 19291 [2018-11-06 19:59:54,433 INFO L604 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-11-06 19:59:54,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19291 states. [2018-11-06 19:59:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19291 to 19286. [2018-11-06 19:59:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19286 states. [2018-11-06 19:59:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19286 states to 19286 states and 21819 transitions. [2018-11-06 19:59:54,690 INFO L78 Accepts]: Start accepts. Automaton has 19286 states and 21819 transitions. Word has length 230 [2018-11-06 19:59:54,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:54,690 INFO L480 AbstractCegarLoop]: Abstraction has 19286 states and 21819 transitions. [2018-11-06 19:59:54,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 19286 states and 21819 transitions. [2018-11-06 19:59:54,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-06 19:59:54,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:54,725 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, 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-11-06 19:59:54,725 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:54,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:54,726 INFO L82 PathProgramCache]: Analyzing trace with hash -68785608, now seen corresponding path program 1 times [2018-11-06 19:59:54,726 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:54,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:54,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:54,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:54,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-06 19:59:54,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:54,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:59:54,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:54,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:54,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:54,874 INFO L87 Difference]: Start difference. First operand 19286 states and 21819 transitions. Second operand 3 states. [2018-11-06 19:59:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:56,358 INFO L93 Difference]: Finished difference Result 43672 states and 49854 transitions. [2018-11-06 19:59:56,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:56,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-11-06 19:59:56,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:56,397 INFO L225 Difference]: With dead ends: 43672 [2018-11-06 19:59:56,397 INFO L226 Difference]: Without dead ends: 24388 [2018-11-06 19:59:56,415 INFO L604 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-11-06 19:59:56,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24388 states. [2018-11-06 19:59:56,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24388 to 24385. [2018-11-06 19:59:56,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24385 states. [2018-11-06 19:59:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24385 states to 24385 states and 26949 transitions. [2018-11-06 19:59:56,755 INFO L78 Accepts]: Start accepts. Automaton has 24385 states and 26949 transitions. Word has length 237 [2018-11-06 19:59:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:56,755 INFO L480 AbstractCegarLoop]: Abstraction has 24385 states and 26949 transitions. [2018-11-06 19:59:56,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:59:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 24385 states and 26949 transitions. [2018-11-06 19:59:56,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-11-06 19:59:56,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:56,793 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:59:56,793 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:56,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:56,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1345461011, now seen corresponding path program 1 times [2018-11-06 19:59:56,794 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:56,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:56,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:56,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:56,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:57,140 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:59:57,372 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-06 19:59:57,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:57,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:59:57,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:59:57,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:59:57,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:59:57,374 INFO L87 Difference]: Start difference. First operand 24385 states and 26949 transitions. Second operand 4 states. [2018-11-06 19:59:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:58,531 INFO L93 Difference]: Finished difference Result 48164 states and 53270 transitions. [2018-11-06 19:59:58,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:59:58,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 289 [2018-11-06 19:59:58,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:58,567 INFO L225 Difference]: With dead ends: 48164 [2018-11-06 19:59:58,567 INFO L226 Difference]: Without dead ends: 23781 [2018-11-06 19:59:58,588 INFO L604 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-11-06 19:59:58,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23781 states. [2018-11-06 19:59:58,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23781 to 23770. [2018-11-06 19:59:58,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23770 states. [2018-11-06 19:59:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23770 states to 23770 states and 26127 transitions. [2018-11-06 19:59:58,872 INFO L78 Accepts]: Start accepts. Automaton has 23770 states and 26127 transitions. Word has length 289 [2018-11-06 19:59:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:59:58,873 INFO L480 AbstractCegarLoop]: Abstraction has 23770 states and 26127 transitions. [2018-11-06 19:59:58,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:59:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 23770 states and 26127 transitions. [2018-11-06 19:59:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-11-06 19:59:58,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:59:58,896 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:59:58,896 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:59:58,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:59:58,897 INFO L82 PathProgramCache]: Analyzing trace with hash 2113406810, now seen corresponding path program 1 times [2018-11-06 19:59:58,897 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:59:58,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:59:58,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:58,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:59:58,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:59:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:59:59,168 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-06 19:59:59,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:59:59,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:59:59,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:59:59,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:59:59,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:59:59,170 INFO L87 Difference]: Start difference. First operand 23770 states and 26127 transitions. Second operand 3 states. [2018-11-06 20:00:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:00,129 INFO L93 Difference]: Finished difference Result 47536 states and 52250 transitions. [2018-11-06 20:00:00,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 20:00:00,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2018-11-06 20:00:00,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:00,157 INFO L225 Difference]: With dead ends: 47536 [2018-11-06 20:00:00,157 INFO L226 Difference]: Without dead ends: 23768 [2018-11-06 20:00:00,174 INFO L604 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-11-06 20:00:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23768 states. [2018-11-06 20:00:00,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23768 to 23768. [2018-11-06 20:00:00,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23768 states. [2018-11-06 20:00:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23768 states to 23768 states and 26123 transitions. [2018-11-06 20:00:00,465 INFO L78 Accepts]: Start accepts. Automaton has 23768 states and 26123 transitions. Word has length 317 [2018-11-06 20:00:00,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:00,465 INFO L480 AbstractCegarLoop]: Abstraction has 23768 states and 26123 transitions. [2018-11-06 20:00:00,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 20:00:00,466 INFO L276 IsEmpty]: Start isEmpty. Operand 23768 states and 26123 transitions. [2018-11-06 20:00:00,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-11-06 20:00:00,486 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:00,487 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:00,487 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:00,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:00,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1833264674, now seen corresponding path program 1 times [2018-11-06 20:00:00,488 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:00,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:00,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:00,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:00,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-06 20:00:00,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:00,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 20:00:00,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 20:00:00,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 20:00:00,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 20:00:00,992 INFO L87 Difference]: Start difference. First operand 23768 states and 26123 transitions. Second operand 5 states. [2018-11-06 20:00:03,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:03,152 INFO L93 Difference]: Finished difference Result 66805 states and 73669 transitions. [2018-11-06 20:00:03,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 20:00:03,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 327 [2018-11-06 20:00:03,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:03,201 INFO L225 Difference]: With dead ends: 66805 [2018-11-06 20:00:03,201 INFO L226 Difference]: Without dead ends: 43039 [2018-11-06 20:00:03,225 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 20:00:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43039 states. [2018-11-06 20:00:03,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43039 to 41383. [2018-11-06 20:00:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41383 states. [2018-11-06 20:00:03,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41383 states to 41383 states and 45570 transitions. [2018-11-06 20:00:03,726 INFO L78 Accepts]: Start accepts. Automaton has 41383 states and 45570 transitions. Word has length 327 [2018-11-06 20:00:03,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:03,727 INFO L480 AbstractCegarLoop]: Abstraction has 41383 states and 45570 transitions. [2018-11-06 20:00:03,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 20:00:03,727 INFO L276 IsEmpty]: Start isEmpty. Operand 41383 states and 45570 transitions. [2018-11-06 20:00:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-11-06 20:00:03,751 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:03,752 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 20:00:03,752 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:03,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:03,753 INFO L82 PathProgramCache]: Analyzing trace with hash -153782652, now seen corresponding path program 1 times [2018-11-06 20:00:03,753 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:03,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:03,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:03,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:03,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-06 20:00:04,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:04,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:04,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:00:04,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:00:04,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:04,140 INFO L87 Difference]: Start difference. First operand 41383 states and 45570 transitions. Second operand 4 states. [2018-11-06 20:00:07,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:07,188 INFO L93 Difference]: Finished difference Result 86252 states and 95150 transitions. [2018-11-06 20:00:07,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:00:07,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2018-11-06 20:00:07,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:07,232 INFO L225 Difference]: With dead ends: 86252 [2018-11-06 20:00:07,233 INFO L226 Difference]: Without dead ends: 44871 [2018-11-06 20:00:07,258 INFO L604 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-11-06 20:00:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44871 states. [2018-11-06 20:00:07,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44871 to 44860. [2018-11-06 20:00:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44860 states. [2018-11-06 20:00:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44860 states to 44860 states and 49424 transitions. [2018-11-06 20:00:07,752 INFO L78 Accepts]: Start accepts. Automaton has 44860 states and 49424 transitions. Word has length 333 [2018-11-06 20:00:07,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:07,752 INFO L480 AbstractCegarLoop]: Abstraction has 44860 states and 49424 transitions. [2018-11-06 20:00:07,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 44860 states and 49424 transitions. [2018-11-06 20:00:07,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-11-06 20:00:07,785 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:07,785 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 20:00:07,786 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:07,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:07,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1951369640, now seen corresponding path program 1 times [2018-11-06 20:00:07,786 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:07,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:07,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:07,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:07,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:08,597 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 20:00:08,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:08,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:08,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 20:00:08,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 20:00:08,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 20:00:08,599 INFO L87 Difference]: Start difference. First operand 44860 states and 49424 transitions. Second operand 3 states. [2018-11-06 20:00:09,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:09,901 INFO L93 Difference]: Finished difference Result 92984 states and 102537 transitions. [2018-11-06 20:00:09,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 20:00:09,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2018-11-06 20:00:09,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:09,954 INFO L225 Difference]: With dead ends: 92984 [2018-11-06 20:00:09,955 INFO L226 Difference]: Without dead ends: 48126 [2018-11-06 20:00:09,984 INFO L604 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-11-06 20:00:10,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48126 states. [2018-11-06 20:00:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48126 to 48124. [2018-11-06 20:00:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48124 states. [2018-11-06 20:00:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48124 states to 48124 states and 52868 transitions. [2018-11-06 20:00:10,464 INFO L78 Accepts]: Start accepts. Automaton has 48124 states and 52868 transitions. Word has length 348 [2018-11-06 20:00:10,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:10,465 INFO L480 AbstractCegarLoop]: Abstraction has 48124 states and 52868 transitions. [2018-11-06 20:00:10,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 20:00:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 48124 states and 52868 transitions. [2018-11-06 20:00:10,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-11-06 20:00:10,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:10,489 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 20:00:10,489 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:10,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:10,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1820103627, now seen corresponding path program 1 times [2018-11-06 20:00:10,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:10,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:10,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:10,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:10,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-06 20:00:10,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:10,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:10,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:00:10,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:00:10,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:10,987 INFO L87 Difference]: Start difference. First operand 48124 states and 52868 transitions. Second operand 4 states. [2018-11-06 20:00:12,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:12,212 INFO L93 Difference]: Finished difference Result 182061 states and 200055 transitions. [2018-11-06 20:00:12,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:00:12,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 361 [2018-11-06 20:00:12,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:12,354 INFO L225 Difference]: With dead ends: 182061 [2018-11-06 20:00:12,354 INFO L226 Difference]: Without dead ends: 133939 [2018-11-06 20:00:12,402 INFO L604 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-11-06 20:00:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133939 states. [2018-11-06 20:00:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133939 to 87246. [2018-11-06 20:00:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87246 states. [2018-11-06 20:00:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87246 states to 87246 states and 95790 transitions. [2018-11-06 20:00:14,082 INFO L78 Accepts]: Start accepts. Automaton has 87246 states and 95790 transitions. Word has length 361 [2018-11-06 20:00:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:14,082 INFO L480 AbstractCegarLoop]: Abstraction has 87246 states and 95790 transitions. [2018-11-06 20:00:14,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 87246 states and 95790 transitions. [2018-11-06 20:00:14,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-11-06 20:00:14,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:14,105 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:14,105 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:14,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:14,105 INFO L82 PathProgramCache]: Analyzing trace with hash 582272980, now seen corresponding path program 1 times [2018-11-06 20:00:14,105 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:14,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:14,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:14,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:14,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 190 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-06 20:00:14,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 20:00:14,627 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 20:00:14,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:14,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 20:00:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-06 20:00:14,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 20:00:14,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-06 20:00:14,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 20:00:14,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 20:00:14,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 20:00:14,957 INFO L87 Difference]: Start difference. First operand 87246 states and 95790 transitions. Second operand 5 states. [2018-11-06 20:00:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:19,120 INFO L93 Difference]: Finished difference Result 166273 states and 182877 transitions. [2018-11-06 20:00:19,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:00:19,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 362 [2018-11-06 20:00:19,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:19,227 INFO L225 Difference]: With dead ends: 166273 [2018-11-06 20:00:19,228 INFO L226 Difference]: Without dead ends: 79029 [2018-11-06 20:00:19,284 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 20:00:19,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79029 states. [2018-11-06 20:00:22,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79029 to 77387. [2018-11-06 20:00:22,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77387 states. [2018-11-06 20:00:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77387 states to 77387 states and 84603 transitions. [2018-11-06 20:00:22,207 INFO L78 Accepts]: Start accepts. Automaton has 77387 states and 84603 transitions. Word has length 362 [2018-11-06 20:00:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:22,208 INFO L480 AbstractCegarLoop]: Abstraction has 77387 states and 84603 transitions. [2018-11-06 20:00:22,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 20:00:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 77387 states and 84603 transitions. [2018-11-06 20:00:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-11-06 20:00:22,270 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:22,271 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:22,271 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:22,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:22,272 INFO L82 PathProgramCache]: Analyzing trace with hash 160490144, now seen corresponding path program 1 times [2018-11-06 20:00:22,272 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:22,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:22,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:22,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:22,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:22,752 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 20:00:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-11-06 20:00:22,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:22,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 20:00:22,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:00:22,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:00:22,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:22,887 INFO L87 Difference]: Start difference. First operand 77387 states and 84603 transitions. Second operand 4 states. [2018-11-06 20:00:25,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:25,373 INFO L93 Difference]: Finished difference Result 155194 states and 169699 transitions. [2018-11-06 20:00:25,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:00:25,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 398 [2018-11-06 20:00:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:25,468 INFO L225 Difference]: With dead ends: 155194 [2018-11-06 20:00:25,469 INFO L226 Difference]: Without dead ends: 77809 [2018-11-06 20:00:25,517 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77809 states. [2018-11-06 20:00:26,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77809 to 77180. [2018-11-06 20:00:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77180 states. [2018-11-06 20:00:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77180 states to 77180 states and 84249 transitions. [2018-11-06 20:00:26,582 INFO L78 Accepts]: Start accepts. Automaton has 77180 states and 84249 transitions. Word has length 398 [2018-11-06 20:00:26,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:26,583 INFO L480 AbstractCegarLoop]: Abstraction has 77180 states and 84249 transitions. [2018-11-06 20:00:26,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:26,583 INFO L276 IsEmpty]: Start isEmpty. Operand 77180 states and 84249 transitions. [2018-11-06 20:00:26,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-11-06 20:00:26,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:26,616 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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:26,616 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:26,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:26,617 INFO L82 PathProgramCache]: Analyzing trace with hash -90678840, now seen corresponding path program 1 times [2018-11-06 20:00:26,617 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:26,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:26,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:26,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:26,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-06 20:00:27,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:27,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 20:00:27,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:00:27,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:00:27,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:00:27,900 INFO L87 Difference]: Start difference. First operand 77180 states and 84249 transitions. Second operand 4 states. [2018-11-06 20:00:30,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:30,620 INFO L93 Difference]: Finished difference Result 219412 states and 238730 transitions. [2018-11-06 20:00:30,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:00:30,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 404 [2018-11-06 20:00:30,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:30,770 INFO L225 Difference]: With dead ends: 219412 [2018-11-06 20:00:30,770 INFO L226 Difference]: Without dead ends: 142234 [2018-11-06 20:00:30,825 INFO L604 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-11-06 20:00:30,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142234 states. [2018-11-06 20:00:32,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142234 to 140382. [2018-11-06 20:00:32,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140382 states. [2018-11-06 20:00:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140382 states to 140382 states and 152503 transitions. [2018-11-06 20:00:32,353 INFO L78 Accepts]: Start accepts. Automaton has 140382 states and 152503 transitions. Word has length 404 [2018-11-06 20:00:32,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:32,354 INFO L480 AbstractCegarLoop]: Abstraction has 140382 states and 152503 transitions. [2018-11-06 20:00:32,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:00:32,354 INFO L276 IsEmpty]: Start isEmpty. Operand 140382 states and 152503 transitions. [2018-11-06 20:00:32,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-11-06 20:00:32,386 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:32,386 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 20:00:32,387 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:32,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:32,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1911073964, now seen corresponding path program 1 times [2018-11-06 20:00:32,387 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:32,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:32,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:32,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:32,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:32,684 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-11-06 20:00:32,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:00:32,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 20:00:32,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 20:00:32,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 20:00:32,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 20:00:32,686 INFO L87 Difference]: Start difference. First operand 140382 states and 152503 transitions. Second operand 5 states. [2018-11-06 20:00:36,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:00:36,449 INFO L93 Difference]: Finished difference Result 370715 states and 401650 transitions. [2018-11-06 20:00:36,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 20:00:36,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 416 [2018-11-06 20:00:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:00:36,686 INFO L225 Difference]: With dead ends: 370715 [2018-11-06 20:00:36,686 INFO L226 Difference]: Without dead ends: 230539 [2018-11-06 20:00:36,767 INFO L604 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-11-06 20:00:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230539 states. [2018-11-06 20:00:39,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230539 to 222349. [2018-11-06 20:00:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222349 states. [2018-11-06 20:00:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222349 states to 222349 states and 240055 transitions. [2018-11-06 20:00:40,211 INFO L78 Accepts]: Start accepts. Automaton has 222349 states and 240055 transitions. Word has length 416 [2018-11-06 20:00:40,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:00:40,211 INFO L480 AbstractCegarLoop]: Abstraction has 222349 states and 240055 transitions. [2018-11-06 20:00:40,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 20:00:40,211 INFO L276 IsEmpty]: Start isEmpty. Operand 222349 states and 240055 transitions. [2018-11-06 20:00:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-11-06 20:00:40,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:00:40,247 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 20:00:40,247 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:00:40,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:00:40,247 INFO L82 PathProgramCache]: Analyzing trace with hash -202726217, now seen corresponding path program 1 times [2018-11-06 20:00:40,247 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:00:40,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:00:40,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:40,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:40,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:00:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:41,614 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 267 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 20:00:41,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 20:00:41,615 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 20:00:41,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:00:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:00:41,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 20:00:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-06 20:00:43,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 20:00:43,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 15 [2018-11-06 20:00:43,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-06 20:00:43,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-06 20:00:43,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-11-06 20:00:43,273 INFO L87 Difference]: Start difference. First operand 222349 states and 240055 transitions. Second operand 16 states. [2018-11-06 20:00:43,642 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-06 20:01:14,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:01:14,944 INFO L93 Difference]: Finished difference Result 847090 states and 914358 transitions. [2018-11-06 20:01:14,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-11-06 20:01:14,944 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 421 [2018-11-06 20:01:14,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:01:15,831 INFO L225 Difference]: With dead ends: 847090 [2018-11-06 20:01:15,831 INFO L226 Difference]: Without dead ends: 624947 [2018-11-06 20:01:15,986 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3196 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1646, Invalid=6726, Unknown=0, NotChecked=0, Total=8372 [2018-11-06 20:01:16,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624947 states. [2018-11-06 20:01:23,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624947 to 458440. [2018-11-06 20:01:23,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458440 states. [2018-11-06 20:01:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458440 states to 458440 states and 493938 transitions. [2018-11-06 20:01:24,805 INFO L78 Accepts]: Start accepts. Automaton has 458440 states and 493938 transitions. Word has length 421 [2018-11-06 20:01:24,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:01:24,805 INFO L480 AbstractCegarLoop]: Abstraction has 458440 states and 493938 transitions. [2018-11-06 20:01:24,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-06 20:01:24,805 INFO L276 IsEmpty]: Start isEmpty. Operand 458440 states and 493938 transitions. [2018-11-06 20:01:24,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-11-06 20:01:24,866 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:01:24,866 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 20:01:24,866 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:01:24,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:01:24,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1819457701, now seen corresponding path program 1 times [2018-11-06 20:01:24,867 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:01:24,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:01:24,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:01:24,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:01:24,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:01:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:01:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-06 20:01:25,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 20:01:25,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 20:01:25,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 20:01:25,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 20:01:25,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:01:25,337 INFO L87 Difference]: Start difference. First operand 458440 states and 493938 transitions. Second operand 4 states. [2018-11-06 20:01:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:01:31,207 INFO L93 Difference]: Finished difference Result 920163 states and 991305 transitions. [2018-11-06 20:01:31,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 20:01:31,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 461 [2018-11-06 20:01:31,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:01:31,779 INFO L225 Difference]: With dead ends: 920163 [2018-11-06 20:01:31,779 INFO L226 Difference]: Without dead ends: 461929 [2018-11-06 20:01:31,967 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 20:01:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461929 states. [2018-11-06 20:01:46,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461929 to 456399. [2018-11-06 20:01:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456399 states. [2018-11-06 20:01:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456399 states to 456399 states and 490645 transitions. [2018-11-06 20:01:47,148 INFO L78 Accepts]: Start accepts. Automaton has 456399 states and 490645 transitions. Word has length 461 [2018-11-06 20:01:47,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 20:01:47,148 INFO L480 AbstractCegarLoop]: Abstraction has 456399 states and 490645 transitions. [2018-11-06 20:01:47,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 20:01:47,148 INFO L276 IsEmpty]: Start isEmpty. Operand 456399 states and 490645 transitions. [2018-11-06 20:01:47,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-11-06 20:01:47,204 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 20:01:47,204 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 20:01:47,204 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 20:01:47,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 20:01:47,205 INFO L82 PathProgramCache]: Analyzing trace with hash 873961078, now seen corresponding path program 1 times [2018-11-06 20:01:47,205 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 20:01:47,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 20:01:47,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:01:47,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:01:47,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 20:01:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:01:47,688 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 20:01:47,895 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 20:01:48,121 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 20:01:48,405 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-11-06 20:01:48,635 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2018-11-06 20:01:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 392 proven. 36 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-06 20:01:49,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 20:01:49,074 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 20:01:49,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 20:01:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 20:01:49,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 20:01:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-06 20:01:50,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 20:01:50,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-11-06 20:01:50,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 20:01:50,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 20:01:50,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-11-06 20:01:50,521 INFO L87 Difference]: Start difference. First operand 456399 states and 490645 transitions. Second operand 11 states. [2018-11-06 20:02:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 20:02:11,478 INFO L93 Difference]: Finished difference Result 2033014 states and 2186882 transitions. [2018-11-06 20:02:11,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-06 20:02:11,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 485 [2018-11-06 20:02:11,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 20:02:15,683 INFO L225 Difference]: With dead ends: 2033014 [2018-11-06 20:02:15,684 INFO L226 Difference]: Without dead ends: 1576817 [2018-11-06 20:02:16,146 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2018-11-06 20:02:17,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576817 states. Received shutdown request... [2018-11-06 20:02:52,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576817 to 1394916. [2018-11-06 20:02:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394916 states. [2018-11-06 20:02:52,027 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 20:02:52,032 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 20:02:52,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 08:02:52 BoogieIcfgContainer [2018-11-06 20:02:52,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 20:02:52,033 INFO L168 Benchmark]: Toolchain (without parser) took 213080.54 ms. Allocated memory was 1.5 GB in the beginning and 6.1 GB in the end (delta: 4.6 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -500.4 MB). Peak memory consumption was 5.2 GB. Max. memory is 7.1 GB. [2018-11-06 20:02:52,034 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 20:02:52,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1188.76 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-11-06 20:02:52,035 INFO L168 Benchmark]: Boogie Procedure Inliner took 321.77 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -837.2 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2018-11-06 20:02:52,036 INFO L168 Benchmark]: Boogie Preprocessor took 137.89 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2018-11-06 20:02:52,037 INFO L168 Benchmark]: RCFGBuilder took 5545.09 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 263.2 MB). Peak memory consumption was 263.2 MB. Max. memory is 7.1 GB. [2018-11-06 20:02:52,037 INFO L168 Benchmark]: TraceAbstraction took 205882.05 ms. Allocated memory was 2.2 GB in the beginning and 6.1 GB in the end (delta: 3.8 GB). Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: -24.9 MB). Peak memory consumption was 4.9 GB. Max. memory is 7.1 GB. [2018-11-06 20:02:52,045 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Cannot interrupt operation gracefully because timeout expired. Forcing shutdown Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1188.76 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 321.77 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -837.2 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 137.89 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5545.09 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 263.2 MB). Peak memory consumption was 263.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 205882.05 ms. Allocated memory was 2.2 GB in the beginning and 6.1 GB in the end (delta: 3.8 GB). Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: -24.9 MB). Peak memory consumption was 4.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1566]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1566). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 205.8s OverallTime, 23 OverallIterations, 6 TraceHistogramMax, 114.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5678 SDtfs, 30679 SDslu, 5398 SDs, 0 SdLazy, 42912 SolverSat, 7134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 65.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1693 GetRequests, 1533 SyntacticMatches, 6 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3300 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=458440occurred in iteration=21, 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: 74.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 235164 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 8480 NumberOfCodeBlocks, 8480 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 8453 ConstructedInterpolants, 0 QuantifiedInterpolants, 9697552 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2496 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 27 InterpolantComputations, 23 PerfectInterpolantSequences, 5714/5942 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available